Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
Open Access
- 1 January 2014
- journal article
- research article
- Published by Wiley in The Scientific World Journal
- Vol. 2014, 1-12
Abstract
The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between charged particles in a multidimensional space for global optimization. This paper investigates the problem-specific constraint handling capability of the EMA framework using a new variable bounding strategy, in which real-coded particle’s boundary constraints associated with the corresponding time windows of customers, is introduced and combined with the penalty approach to eliminate infeasibilities regarding time window violations. The performance of the proposed algorithm and the effectiveness of the constraint handling technique have been studied extensively, comparing it to that of state-of-the-art metaheuristics using several sets of benchmark problems reported in the literature. The results of the numerical experiments show that the EMA generates feasible and near-optimal results within shorter computational times compared to the test algorithms.Keywords
Funding Information
- Uludag University Scientific Research Council (KUAP(M)-2012/32)
This publication has 34 references indexed in Scilit:
- Nonlinear systems design by a novel fuzzy neural system via hybridization of electromagnetism-like mechanism and particle swarm optimisation algorithmsInformation Sciences, 2012
- Revised electromagnetism-like mechanism for flow path design of unidirectional AGV systemsInternational Journal of Production Research, 2011
- Fractional-order PID controller optimization via improved electromagnetism-like algorithmExpert Systems with Applications, 2010
- A General VNS heuristic for the traveling salesman problem with time windowsDiscrete Optimization, 2010
- A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problemsExpert Systems with Applications, 2010
- Solving the response time variability problem by means of the electromagnetism-like mechanismInternational Journal of Production Research, 2009
- A hybrid electromagnetism-like algorithm for single machine scheduling problemExpert Systems with Applications, 2009
- Multi-objective inventory control using electromagnetism-like meta-heuristicInternational Journal of Production Research, 2008
- A two‐commodity flow formulation for the traveling salesman and the makespan problems with time windowsNetworks, 1993
- Local search in routing problems with time windowsAnnals of Operations Research, 1985