A guided simulated annealing search for solving the pick-up and delivery problem with time windows and capacity constraints

Author： Urban Karsten-Patrick  

Publisher： Taylor & Francis Ltd

ISSN： 1367-5567

Source： International Journal of Logistics, Vol.9, Iss.4, 2006-12, pp. : 369-381

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Simulated annealing for improving the solution of the response time variability problem

By García-Villoria Alberto   Pastor Rafael  

International Journal of Production Research, Vol. 51, Iss. 16, 2013-08 ,pp. : 4911-4920

Taylor & Francis Ltd

Access to resources Recommend Favorite

Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems

By Zolfaghari S.   Liang M.  

International Journal of Production Research, Vol. 40, Iss. 9, 2002-06 ,pp. : 2141-2158

Taylor & Francis Ltd

Access to resources Recommend Favorite

Jointly solving the group scheduling and machining speed selection problems: a hybrid tabu search and simulated annealing approach

By Zolfaghari S.   Liang M.  

International Journal of Production Research, Vol. 37, Iss. 10, 1999-07 ,pp. : 2377-2397

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem

By Chan Felix T.S.   Prakash Anuj   Ma H.L.   Wong C.S.  

International Journal of Production Research, Vol. 51, Iss. 9, 2013-05 ,pp. : 2602-2619

Taylor & Francis Ltd

Access to resources Recommend Favorite

A simulated annealing with multiple‐search paths and parallel computation for a comprehensive flowshop scheduling problem

By  

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 22, Iss. 4, 2015-07 ,pp. : 669-691

John Wiley & Sons Inc

Access to resources Recommend Favorite