loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Tao-Shen Li 1 and Jing-Li Wu 2

Affiliations: 1 School of Computer, Electronics and Information, Guangxi University, China ; 2 School of Mathematics and Computer, Guangxi Normal University, China

ISBN: 972-8865-32-5

Keyword(s): Vehicle routing problem with time windows; Genetic algorithm; Crossover operator; Routing; heuristics.

Related Ontology Subjects/Areas/Topics: Business and Social Applications ; Communication and Software Infrastructure ; e-Business ; e-Commerce and e-Business: B2B and B2C ; e-Marketing and Consumer Behaviour ; Enterprise Information Systems ; Global Communication Information Systems and Services ; Information and Systems Security ; Telecommunications

Abstract: Many practical transport logistics and distribution problems can be formulated as the vehicle routing problem with time windows (VRPTM). The objective is to design an optimal set of routes that services all customers and satisfies the given constraints, especially the time window constraints. The complexity of the VRPTW requires heuristic solution strategies for most real-life instances. However, the VRPTM is a combination optimization problem and is a NP-complete problem, so we can’t get satisfying results when we use exact approaches and normal heuristic ones. In this paper, an improved genetic algorithm to solve the VRPTM problem is developed, which use an improved Route Crossover operator (RC’) and can meet the needs for solving VRPTM problem. Computational experiments show that the GA based on RC’ can obtain a general optimality for all evaluated indexes on the premise of satisfying every customer’s demand and its performance is superior to the GA based on PMX or RC.

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.2.246

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Li T.; Wu J. and (2005). AN IMPROVED GENETIC ALGORITHM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS.In Proceedings of the Second International Conference on e-Business and Telecommunication Networks - Volume 1: ICETE, ISBN 972-8865-32-5, pages 143-149. DOI: 10.5220/0001415101430149

@conference{icete05,
author={Tao{-}Shen Li and Jing{-}Li Wu},
title={AN IMPROVED GENETIC ALGORITHM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS},
booktitle={Proceedings of the Second International Conference on e-Business and Telecommunication Networks - Volume 1: ICETE,},
year={2005},
pages={143-149},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001415101430149},
isbn={972-8865-32-5},
}

TY - CONF

JO - Proceedings of the Second International Conference on e-Business and Telecommunication Networks - Volume 1: ICETE,
TI - AN IMPROVED GENETIC ALGORITHM FOR SOLVING THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
SN - 972-8865-32-5
AU - Li, T.
AU - Wu, J.
PY - 2005
SP - 143
EP - 149
DO - 10.5220/0001415101430149

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.