Heuristics for the mixed swapping problem

Computers and Operations Research

Volumn 37, Issue 1, 2010, Pages 108-114

  Bordenave, Charles ^a   Gendreau, Michel ^a   Laporte, Gilbert ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Heuristic; Transportation problem; Vehicle routing

Indexed keywords

ARBITRARY VERTICES; AVERAGE OPTIMALITY; DIRECTED GRAPHS; HEURISTIC; MINIMUM COST; SUPPLY AND DEMAND; TRANSPORTATION PROBLEM; UNIT CAPACITY;

GRAPH THEORY; HEURISTIC METHODS; VEHICLE ROUTING;

COMPETITION;

EID: 68249126544     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.03.032     Document Type: Article

References (19)

1. Boost C ++ libraries, 2001 〈http://www.boost.org〉.
2. Anily S., and Hassin R. The swapping problem. Networks 22 (1992) 419-433
3. Anily S., Gendreau M., and Laporte G. The swapping problem on a line. SIAM Journal on Computing 29 (1999) 327-335
4. Anily S, Gendreau M, Laporte G. The preemptive swapping problem on a tree, 2009, submitted for publication.
5. Applegate DL, Bixby RE, Chvátal V, Cook WJ. Concorde TSP solver, 1995 〈http://www.tsp.gatech.edu/concorde.html〉.
6. Atallah M.J., and Kosaraju S.R. Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM Journal on Computing 17 (1988) 849-869
7. Bordenave C, Gendreau M, Laporte G. A branch-and-cut algorithm for the preemptive swapping problem, 2008, submitted for publication.
8. Bordenave C, Gendreau M, Laporte G. A branch-and-cut algorithm for the non-preemptive swapping problem. Naval Research Logistics, 2009, to appear.
9. Chalasani P., and Motwani R. Approximating capacitated routing and delivery problems. SIAM Journal on Computing 28 (1999) 2133-2149
10. Cook W.J., and Rohe A. Computing minimum weight perfect matchings. INFORMS Journal on Computing 11 (1997) 138-148
11. Corberán A., Martí R., and Romero A. Heuristics for the mixed rural postman problem. Computers and Operations Research 27 (2000) 183-203
12. Edmonds J. Paths, trees and flowers. Canadian Journal of Mathematics 17 (1965) 449-467
13. Frederickson G.N., and Guan D.J. Preemptive ensemble motion planning on a tree. SIAM Journal on Computing 21 (1992) 1130-1152
14. Frederickson G.N., and Guan D.J. Nonpreemptive ensemble motion planning on a tree. Journal of Algorithms 15 (1993) 29-60
15. Frederickson G.N., Hecht M.S., and Kim C.E. Approximation algorithms for some routing problems. SIAM Journal on Computing 7 (1978) 178-193
16. Hierholzer C. Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechnung zu umfahren. Mathematische Annalen 6 (1873) 30-32
17. Kruskal J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50
18. Kuhn H.W. The Hungarian method for the assignment problem. Naval Research Logistics Quaterly 2 (1955) 83-97
19. Munkres J. Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics 5 (1957) 32-38