Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6239 LNCS, Issue PART 2, 2010, Pages 189-198

  Hosny, Manar I ^a   Mumford, Christine L ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE SIZES; NEIGHBORHOOD SIZE; PICKUP AND DELIVERY PROBLEMS; PROCESSING TIME; TEST CASE;

PICKUPS;

PROBLEM SOLVING;

EID: 78149244709     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15871-1_20     Document Type: Conference Paper

References (9)

1. Dorband, J., Mumford, C.L., Wang, P.: Developing an ace solution for two-dimensional strip packing. In: 18th International Parallel and Distributed Processing Symposium Workshop on Massively Parallel Processing (2004)
2. Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics, Advances and Trends in Local Search Paradigms for Optimization, pp. 433-458. Kluwer Academic Publishers, Dordrecht (1998)
3. Hansen, P., Mladenović, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research 130(3), 449-467 (2001)
4. Hernández-Pérez, H., Rodríguez-Martín, I., Salazar-González, J.-J.: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research 36(5), 1639-1645 (2008)
5. Hernández-Pérez, H., Salazar-González, J.-J.: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics 145(1), 126-139 (2004)
6. Hernández-Pérez, H., Salazar-González, J.-J.: Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 38(2), 245-255 (2004)
7. Martinović, G., Aleksi, I., Baumgartner, A.: Single-commodity vehicle routing problem with pickup and delivery service. Mathematical Problems in Engineering 2008, 1-17 (2008), doi:10.1155/2008/697981
8. Placek, M., Hartl, R.F., Doerner, K.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10, 613-627 (2004)
9. Zhao, F., Li, S., Sun, J., Mei, D.: Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Industrial Engineering 56(4), 1642-1648 (2008)