Memetic algorithm for the multiple traveling repairman problem with profits
Authors:
- Yongliang LuYLYongliang Lu
- Una BenlicUBUna Benlic
- Qinghua WuQWQinghua Wu
- Bo PengBPBo Peng
- 1 April 2019
- journal article
- research article
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 80, 35-47
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation (71850410545, 71401059, 71620107002, 71531009)
- Huazhong University of Science and Technology, China (5001300001)
This publication has 35 references indexed in Scilit:
- An iterative three-component heuristic for the team orienteering problem with time windowsEuropean Journal of Operational Research, 2014
- An augmented large neighborhood search method for solving the team orienteering problemExpert Systems with Applications, 2013
- A simple and effective metaheuristic for the Minimum Latency ProblemEuropean Journal of Operational Research, 2012
- Memetic algorithms and memetic computing optimization: A literature reviewSwarm and Evolutionary Computation, 2012
- A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and DeliveryComputers & Operations Research, 2010
- A search space “cartography” for guiding graph coloring heuristicsComputers & Operations Research, 2010
- The k -traveling repairmen problemACM Transactions on Algorithms, 2007
- Scheduling technicians for planned maintenance of geographically distributed equipmentTransportation Research Part E: Logistics and Transportation Review, 2007
- Variable neighborhood searchComputers & Operations Research, 1997
- The team orienteering problemEuropean Journal of Operational Research, 1996