Multiobjective vehicle routing problem with fixed delivery and optional collections

Luciana P. Assis; André L. Maravilha; Alessandro Vivas; Felipe Campelo; Jaime A. Ramírez

doi:10.1007/s11590-012-0551-z

Multiobjective vehicle routing problem with fixed delivery and optional collections

Luciana P. Assis, André L. Maravilha, Alessandro Vivas, Felipe Campelo, Jaime A. Ramírez

College of Engineering and Physical Sciences

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

Abstract

We present an adaption on the formulation for the vehicle routing problem with fixed delivery and optional collections, in which the simultaneous minimization of route costs and of collection demands not fulfilled is considered. We also propose a multiobjective version of the iterated local search (MOILS). The performance of the MOILS is compared with the ε-constrained (P_ε) ILS, the NSGA-II and the indicator-based multi-objective local search methods in the solution of 14 problem instances containing between 50 and 199 customers plus the depot. The results indicate that the MOILS outperformed the other approaches, obtaining significantly better average values for coverage, hypervolume and cardinality.

Original language	English
Pages (from-to)	1419-1431
Number of pages	13
Journal	Optimization Letters
Volume	7
Issue number	7
DOIs	https://doi.org/10.1007/s11590-012-0551-z
Publication status	Published - Oct 2013

Funding

Acknowledgments This work was supported by the following agencies: National Council for Research and Development (CNPq), grants 306910/2006-3 and 472446/2010-0; the Coordination for the Improvement of Higher Education Personnel (CAPES); and the Research Foundation of the State of Minas Gerais (FAPEMIG, Brazil), grants Pronex: TEC 01075/09 and Pronem: CEX APQ-04611-10.

Keywords

Iterated local search
Multiobjective optimization
Selective pickups
Vehicle routing problem

Access to Document

10.1007/s11590-012-0551-z

Cite this

@article{711f85c0a1af4b1fb986e1de162f388c,

title = "Multiobjective vehicle routing problem with fixed delivery and optional collections",

abstract = "We present an adaption on the formulation for the vehicle routing problem with fixed delivery and optional collections, in which the simultaneous minimization of route costs and of collection demands not fulfilled is considered. We also propose a multiobjective version of the iterated local search (MOILS). The performance of the MOILS is compared with the ε-constrained (Pε) ILS, the NSGA-II and the indicator-based multi-objective local search methods in the solution of 14 problem instances containing between 50 and 199 customers plus the depot. The results indicate that the MOILS outperformed the other approaches, obtaining significantly better average values for coverage, hypervolume and cardinality.",

keywords = "Iterated local search, Multiobjective optimization, Selective pickups, Vehicle routing problem",

author = "Assis, {Luciana P.} and Maravilha, {Andr{\'e} L.} and Alessandro Vivas and Felipe Campelo and Ram{\'i}rez, {Jaime A.}",

year = "2013",

month = oct,

doi = "10.1007/s11590-012-0551-z",

language = "English",

volume = "7",

pages = "1419--1431",

journal = "Optimization Letters",

issn = "1862-4472",

publisher = "Springer",

number = "7",

}

TY - JOUR

T1 - Multiobjective vehicle routing problem with fixed delivery and optional collections

AU - Assis, Luciana P.

AU - Maravilha, André L.

AU - Vivas, Alessandro

AU - Campelo, Felipe

AU - Ramírez, Jaime A.

PY - 2013/10

Y1 - 2013/10

N2 - We present an adaption on the formulation for the vehicle routing problem with fixed delivery and optional collections, in which the simultaneous minimization of route costs and of collection demands not fulfilled is considered. We also propose a multiobjective version of the iterated local search (MOILS). The performance of the MOILS is compared with the ε-constrained (Pε) ILS, the NSGA-II and the indicator-based multi-objective local search methods in the solution of 14 problem instances containing between 50 and 199 customers plus the depot. The results indicate that the MOILS outperformed the other approaches, obtaining significantly better average values for coverage, hypervolume and cardinality.

AB - We present an adaption on the formulation for the vehicle routing problem with fixed delivery and optional collections, in which the simultaneous minimization of route costs and of collection demands not fulfilled is considered. We also propose a multiobjective version of the iterated local search (MOILS). The performance of the MOILS is compared with the ε-constrained (Pε) ILS, the NSGA-II and the indicator-based multi-objective local search methods in the solution of 14 problem instances containing between 50 and 199 customers plus the depot. The results indicate that the MOILS outperformed the other approaches, obtaining significantly better average values for coverage, hypervolume and cardinality.

KW - Iterated local search

KW - Multiobjective optimization

KW - Selective pickups

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=84884673311&partnerID=8YFLogxK

UR - https://link.springer.com/article/10.1007%2Fs11590-012-0551-z

U2 - 10.1007/s11590-012-0551-z

DO - 10.1007/s11590-012-0551-z

M3 - Article

AN - SCOPUS:84884673311

SN - 1862-4472

VL - 7

SP - 1419

EP - 1431

JO - Optimization Letters

JF - Optimization Letters

IS - 7

ER -

Multiobjective vehicle routing problem with fixed delivery and optional collections

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this