A neural network algorithm for the traveling salesman problem with backhauls

Authors:
Hassan Ghaziri;Ibrahim H. Osman
Affiliations:
School of Business, Center for Advanced Mathematical Studies, American University of Beirut, P.O. Box 11-0236, Bliss Street, Beirut, Lebanon;School of Business, Center for Advanced Mathematical Studies, American University of Beirut, P.O. Box 11-0236, Bliss Street, Beirut, Lebanon
Venue:
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
Year:
2003

Citing 13
Cited 7

Neural network methods in combinatorial optimization

Computers and Operations Research - Special issue on neural networks and operations research
An additive bounding procedure for the asymmetric travelling salesman problem

Mathematical Programming: Series A and B
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Neural methods for the traveling salesman problem: insights from operations research

Neural Networks
The traveling salesman problem with backhauls

Computers and Operations Research
An investigation into the improvement of local minima of the Hopfield network

Neural Networks
Heuristic approaches to vehicle routing with backhauls and time windows

Computers and Operations Research
Self-organizing maps

Self-organizing maps
Variable neighborhood search

Computers and Operations Research
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

Neural Networks
A heuristic for the pickup and delivery traveling salesman problem

Computers and Operations Research
Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research

INFORMS Journal on Computing
Performance of Various Computers Using Standard Linear Equations Software

Performance of Various Computers Using Standard Linear Equations Software

Guest Editors' Introduction: Advanced Heuristics in Transportation and Logistics

IEEE Intelligent Systems
Self-organizing feature maps for the vehicle routing problem with backhauls

Journal of Scheduling
Prediction of area and length complexity measures for binary decision diagrams

Expert Systems with Applications: An International Journal
Open architecture of CNC system research based on CAD graph-driven technology

Robotics and Computer-Integrated Manufacturing
Approximate solution of the multiple watchman routes problem with restricted visibility range

IEEE Transactions on Neural Networks
Heuristics for determining a patrol path of an unmanned combat vehicle

Computers and Industrial Engineering
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new heuristic based on Kohonen's self-organizing feature map for the traveling salesman problem with backhauls (TSPB). The TSPB is an extension of the traveling salesman problem in which a set of customers is partitioned into a set of linehaul customers to be visited contiguously at the beginning of the route and a set of backhaul customers to be visited once all linehaul customers have been visited. The major innovation of the proposed heuristic is based on the design of a new network architecture, which consists of two separate chains of neurons. The network evolves into a feasible TSPB tour using four types of interactions: (1) the first chain interacts with the linehaul customers, (2) the second chain interacts with the backhaul customers, (3) the tails of the chains interacts together, and (4) the heads of the two chains interact with the depot. The generated tour is then improved using the 2-opt procedure. The new heuristic is compared to the best available TSPB heuristics in the literature on medium to large-sized instances up to 1000 customers. The computational results demonstrate that the proposed approach is comparable in terms of solution quality and computational requirements.