Advanced search
Publication Cover
Journal of the Operational Research Society Volume 43, 1992 - Issue 5: Mathematical Programming in Honour of Ailsa Land
Submit an article Journal homepage
3
Views
17
CrossRef citations to date
0
Altmetric
General Paper

A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems

Gilbert LaporteUniversité de MontréalCanada
,
Hélène MercureUniversité de MontréalCanada
&
Yves NobertUniversié du Québec à MontréalCanada
Pages 469-481 | Published online: 20 Dec 2017

Citations (17)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

Wenbin Hu, Bo Du, Ye Wu, Huangle Liang, Chao Peng & Qi Hu. (2016) A hybrid column generation algorithm based on metaheuristic optimization. Transport 31:4, pages 389-407.
Read now

Articles from other publishers (16)

Anurag Tiwari & Priyabrata Mohapatra. (2023) A hybrid approach to solve a raw material collecting vehicle routing problem. Benchmarking: An International Journal.
Crossref
Mohammad Taghi Taghavifard. (2016) A Bi-Objective Vehicle Routing Problem Considering Distributors' Satisfaction Using Genetic Algorithm and Simulated Annealing. International Journal of Strategic Decision Sciences 7:3, pages 86-100.
Crossref
Hassan Rashidi & Edward Tsang. 2015. Vehicle Scheduling in Port Automation. Vehicle Scheduling in Port Automation 160 173 .
Narges Norouzi, Mohsen Sadegh-Amalnick & Mehdi Alinaghiyan. (2015) Evaluating of the particle swarm optimization in a periodic vehicle routing problem. Measurement 62, pages 162-169.
Crossref
Reza Tavakkoli-Moghaddam, Mehdi Alinaghian, Alireza Salamat-Bakhsh & Narges Norouzi. (2012) A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction. Journal of Industrial Engineering International 8:1.
Crossref
R. Tavakkoli-Moghaddam, M. Gazanfari, M. Alinaghian, A. Salamatbakhsh & N. Norouzi. (2011) A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. Journal of Manufacturing Systems 30:2, pages 83-92.
Crossref
강성민. (2009) A Heuristic Algorithm for the Asymmetric Vehicle Routing Problem. Korean Journal of Logistics 17:2, pages 5-18.
Crossref
G. Gutin & D. Karapetyan. (2008) A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Computing 1:1, pages 25-34.
Crossref
Lixin Tang & Xianpeng Wang. (2005) Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. The International Journal of Advanced Manufacturing Technology 29:11-12, pages 1246-1258.
Crossref
Huali Sun, Jianying Xie & Yaofeng Xue. (2005) A Genetic Clustering-Based TCNN Algorithm for Capacity Vehicle Routing Problem. A Genetic Clustering-Based TCNN Algorithm for Capacity Vehicle Routing Problem.
Joaquín Bautista & Jordi Pereira. 2004. Ant Colony Optimization and Swarm Intelligence. Ant Colony Optimization and Swarm Intelligence 302 309 .
L. Caccetta & S.P. Hill. (2001) Branch and cut methods for network optimization. Mathematical and Computer Modelling 33:4-5, pages 517-532.
Crossref
Louis Caccetta. 2000. Progress in Optimization. Progress in Optimization 21 44 .
K.K. Lau, M.J. Kumar & N.R. Achuthan. (1997) Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs. Parallel implementation of branch and bound algorithm for solving vehicle routing problem on NOWs.
N.R. Achuthan, L. Caccetta & S.P. Hill. (1996) A new subtour elimination constraint for the vehicle routing problem. European Journal of Operational Research 91:3, pages 573-586.
Crossref
Gilbert Laporte & Ibrahim H. Osman. (1995) Routing problems: A bibliography. Annals of Operations Research 61:1, pages 227-262.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.