NDLI: Comparison of neighborhoods for the HFF-AVRP

Content Provider	IEEE Xplore Digital Library
Author	Marmion, M.-E. Humeau, J. Jourdan, L. Dhaenens, C.
Copyright Year	2010
Description	Author affiliation: LIFL / INRIA, Université de Lille 1, INRIA Lille-Nord Europe, Parc Scientifique de la Haute Borne, 40 avenue Halley, Bât A, Park Plaza, 59650 Villeneuve d'Ascq, France (Marmion, M.-E.; Humeau, J.; Jourdan, L.; Dhaenens, C.)
Abstract	Vehicle Routing Problems (VRP) are widely studied as they represent challenges for the future. However, most of the routing problems encountered in the literature are quite far from real life problems. Therefore, this work will be dedicated to the Heterogeneous Fixed Fleet Asymmetric Vehicle Routing Problem (HFF-AVRP), a variant of the VRP, which is more common in real life distribution management than the basic VRP. HFF-AVRP is a NP-hard combinatorial optimization problem. Heuristics and in particular meta-heuristics are then candidate methods to solve such problems. As these methods are very sensitive to neighborhoods, we propose in this article to examine two classical neighborhoods associated to this problem in order to analyze their performances.
Starting Page	1
Ending Page	7
File Size	148722
Page Count	7
File Format	PDF
ISBN	9781424477166
e-ISBN	9781424477173
DOI	10.1109/AICCSA.2010.5586979
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-05-16
Publisher Place	Tunisia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Vehicles Benchmark testing Search methods Routing Indexes Genetic algorithms Optimization methods metaheuristics HFF-AVRP neighborhood
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A comparison of methods for the vehicle routing problem

Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints

Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows

Low-level Teamwork Hybridization for P-metaheuristics: A review and comparison

Honey Bees Mating Optimization for the location routing problem

A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows

Adaptive Neighborhoods for Cellular Genetic Algorithms

Optimization of multi periods Inventory Routing Problem model with time varying demand

A hybrid large neighborhood search for the pickup and delivery problem with time windows

Comparison of neighborhoods for the HFF-AVRP

Similar Documents

A comparison of methods for the vehicle routing problem

Large neighborhood search for the vehicle routing problem with two-dimensional loading constraints

Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows

Low-level Teamwork Hybridization for P-metaheuristics: A review and comparison

Honey Bees Mating Optimization for the location routing problem

A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows

Adaptive Neighborhoods for Cellular Genetic Algorithms

Optimization of multi periods Inventory Routing Problem model with time varying demand

A hybrid large neighborhood search for the pickup and delivery problem with time windows

Comparison of neighborhoods for the HFF-AVRP