Parallel simulated annealing for the delivery problem

Proceedings - 9th Euromicro Workshop on Parallel and Distributed Processing, PDP 2001

Volumn , Issue , 2001, Pages 219-226

  Czech, Z J ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Delivery problem; message passing model of parallel computation; parallel simulated annealing algorithms; set partitioning problem

Indexed keywords

ALGORITHMS; MESSAGE PASSING;

DELIVERY PROBLEMS; NP COMPLETE; OPTIMUM SOLUTION; PARALLEL COMPUTATION; PARALLEL SIMULATED ANNEALING; PARALLEL SIMULATED ANNEALING ALGORITHM; SET PARTITIONING PROBLEM;

SIMULATED ANNEALING;

EID: 3142727583     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2001.905046     Document Type: Conference Paper

References (17)

1. Aarts, E.H.L., and Korst, J.H.M., Simulated annealing and Boltzmann machines, Wiley, Chichester, 1989.
2. Altinkemer, K., Gavish, B., Parallel savings based heuristics for the delivery problem, Operations Research 39, 3 (May-June 1991), 456-469.
3. Azencott, R., Parallel simulated annealing: An overview of basic techniques, in Azencott, R. (Ed.), Simulated annealing. Parallelization techniques, J. Wiley, NY, (1992), 37-46.
4. Boissin, N., and Lutton, J.-L., A parallel simulated annealing algorithm, Parallel Computing 19, (1993), 859-872.
5. Cěrny, V., A thermodynamical approach to the travelling salesman proble: an efficient simulation algorithm, J. of Optimization Theory and Applic. 45, (1985), 41-55.
6. Christofides, N., Mignozzi, A., and Toth, P., Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Math. Prog. 20, (1981), 255-282.
7. Clarke, G, and Wright, J., Scheduling of vehicles from a central depot to a number of delivery points, Opens. res. 12, (1964), 568-581.
8. Czech, Z.J., Parallel simulated annealing for the set-partitioning problem, Proc. of the 8th Euromicro Workshop on Parallel and Distributed Processing, Rhodos, Greece, (January 19-21, 2000), 343-350.
9. Fisher, M.L., and Jaikumar, R., A generalized assignment heuristic for vehicle routing, Networks 11, (1981), 109-124.
10. Greening, D.R., Parallel simulated annealing techniques, Physica D 42, (1990), 293-306.
11. Haimovich, M., and Rinnooy Kan, A., Bounds and heuristics for capacitated routing problems, Math. Opns. Res. 10, (1985), 527-542.
12. Kirkpatrick, S., Gellat, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science 220, (1983), 671-680.
13. Lenstra, J., and Rinnooy, K., Complexity of vehicle routing and scheduling problems, Networks 11, (1981), 221-227.
14. Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., and Teller, E., Equation of state calculation by fast computing machines, Journ. of Chem. Phys. 21, (1953), 1087-1091.
15. Reeves, C.R., (Ed.) Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1995.
16. Scheaffer, R.L., McClave, J.T., Probability and statistics for engineers, Duxbury Press, Calif., 1995.
17. Verhoeven, M.G.A., and Aarts, E.H.L., Parallel local search techniques, Journal of Heuristics 1, (1996), 43-65.