NDLI: The open Capacitated Arc Routing Problem: Complexity and algorithms

Content Provider	IEEE Xplore Digital Library
Author	França, P.M. Usberti, F.L. Morelato, A.L.
Copyright Year	2010
Description	Author affiliation: São Paulo State University, Presidente Prudente, SP-Brazil, 19060-900 (França, P.M.) \|\| Campinas State University, SP - Brazil, 13083-852 (Usberti, F.L.; Morelato, A.L.)
Abstract	The Capacitated Arc Routing Problem (CARP) [1] is a well-known combinatorial optimization problem in which, given an undirected graph G(V ;E) with non-negative costs and demands associated to the edges, we have M identical vehicles with capacity D that must traverse all edges with positive demand. The vehicles must start and finish their tours at a depot node, without transgressing their capacity. The objective is to search for a solution of minimum cost. The CARP was shown to be NP-hard [1], which means that an exact polynomial algorithm for this problem is most unlikely. Nevertheless, there are several heuristics that tackle this problem and which perform very well in most cases. Some of these are path-scanning [2], [3], augment-merge [1], augment-insert [4], among other heuristics [5], [6]. Even better solutions were obtained through meta-heuristics such as the tabu search [7], as well as a genetic algorithm [8], a hybrid tabu-scatter search algorithm [9], and a guided local search [10]. There is also an exact algorithm for the CARP based upon a branch-and-bound strategy [11] which, however, can solve only small size instances (up to 20 required edges). Furthermore, there are algorithms that can determine upper and lower bounds for the CARP [12].
Starting Page	1
Ending Page	1
File Size	62600
Page Count	1
File Format	PDF
ISBN	9781424477166
e-ISBN	9781424477173
DOI	10.1109/AICCSA.2010.5586978
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	Routing Computers Operations research Search problems Optimization Computational modeling Vehicles
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 hybrid two-stage sweep algorithm for capacitated vehicle routing problem

A Memetic Algorithm with Random Key Crossover and Modified Neighborhood Search for the Solution of Capacitated Arc Routing Problems

A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem

Estimation of the Distribution Algorithm With a Stochastic Local Search for Uncertain Capacitated Arc Routing Problems

Solution of VRPTW using controlled random search technique

Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem

Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem

Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems

Applying Simulated Annealing Approach for Capacitated Vehicle Routing Problems

The open Capacitated Arc Routing Problem: Complexity and algorithms

Similar Documents

A hybrid two-stage sweep algorithm for capacitated vehicle routing problem

A Memetic Algorithm with Random Key Crossover and Modified Neighborhood Search for the Solution of Capacitated Arc Routing Problems

A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem

Estimation of the Distribution Algorithm With a Stochastic Local Search for Uncertain Capacitated Arc Routing Problems

Solution of VRPTW using controlled random search technique

Memetic algorithm with heuristic candidate list strategy for Capacitated Arc Routing Problem

Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem

Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems

Applying Simulated Annealing Approach for Capacitated Vehicle Routing Problems

The open Capacitated Arc Routing Problem: Complexity and algorithms