EconPapers    
Economics at your fingertips  
 

A general variable neighborhood search for solving the multi-objective open vehicle routing problem

Jesús Sánchez-Oro (), Ana D. López-Sánchez () and J. Manuel Colmenar ()
Additional contact information
Jesús Sánchez-Oro: Rey Juan Carlos University
Ana D. López-Sánchez: Pablo de Olavide University
J. Manuel Colmenar: Rey Juan Carlos University

Journal of Heuristics, 2020, vol. 26, issue 3, No 6, 423-452

Abstract: Abstract The multi-objective open vehicle routing problem (MO-OVRP) is a variant of the classic vehicle routing problem in which routes are not required to return to the depot after completing their service and where more than one objective is optimized. This work is intended to solve a more realistic and general version of the problem by considering three different objective functions. MO-OVRP seeks solutions that minimize the total number of routes, the total travel cost, and the longest route. For this purpose, we present a general variable neighborhood search algorithm to approximate the efficient set. The performance of the proposal is supported by an extensive computational experimentation which includes the comparison with the well-known multi-objective genetic algorithm NSGA-II.

Keywords: General variable neighborhood search; NSGA-II; Open vehicle routing problem; Sweep algorithm; Local search; Multi-objective optimization (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10732-017-9363-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:26:y:2020:i:3:d:10.1007_s10732-017-9363-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-017-9363-8

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:joheur:v:26:y:2020:i:3:d:10.1007_s10732-017-9363-8