Skip to main content
SpringerLink
Log in

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

  • Papers
  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In the Vehicle Routing Problem with Backhauls (VRPB), a central depot, a fleet of homogeneous vehicles, and a set of customers are given. The set of customers is divided into two subsets. The first (second) set of linehauls (backhauls) consists of customers with known quantity of goods to be delivered from (collected to) the depot. The VRPB objective is to design a set of minimum cost routes; originating and terminating at the central depot to service the set of customers. In this paper, we develop a self-organizing feature maps algorithm, which uses unsupervised competitive neural network concepts. The definition of the architecture of the neural network and its learning rule are the main contribution. The architecture consists of two types of chains: linehaul and backhaul chains. Linehaul chains interact exclusively with linehaul customers. Similarly, backhaul chains interact exclusively with backhaul customers. Additonal types of interactions are introduced in order to form feasible VRPB solution when the algorithm converges. The generated routes are then improved using the well-known 2-opt procedure. The implemented algorithm is compared with other approaches in the literature. The computational results are reported for standard benchmark test problems. They show that the proposed approach is competitive with the most efficient metaheuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aiyer, S. V. B., M. Niranjan, and F. Fallside, “A theoretical investigation into the performance of the Hopfield Model,” IEEE Transactions On Neural Networks, 1, 204–215 (1990).

    Article  Google Scholar 

  • Andresol, R., M. Gendreau, and J.-Y. Potvin, “A Hopfield-tank neural network model for the generalized traveling salesman problem,” in S. Voss, S. Martello, I. H. Osman, and C. Roucairol, (eds.), Meta-Heuristics Advances and Trends in Local Search Paradigms for Optimization, pp. 393–402, Kluwer Academic Publishers, Boston, 1999.

  • Angeniol, B., G. De-La-Croix, and J.-Y. Le-Texier, “Self-organizing feature maps and the traveling salesman problem,” Neural Networks, 1, 289–293 (1988).

    Article  Google Scholar 

  • Anily, S., “The vehicle routing problem with delivery and backhaul options,” Naval Research Logistics, 43, 415–434 (1996).

    Article  Google Scholar 

  • Aras, N., B. J. Oommen, and I. K. Altinel, “The Kohonen network incorporating explicit statistics and its application to the traveling salesman problem,” Neural Networks, 12, 1273–1284 (1999).

    Article  Google Scholar 

  • Burke, L. I. “Adaptive neural networks for the traveling salesman problem: Insights from operations research,” Neural Networks, 7, 681–690 (1994).

    Article  Google Scholar 

  • Casco, D., B. L. Golden, and E. Wasil, “Vehicle routing with backhauls: Models algorithms and cases studies,” in B. L. Golden and A. A. Assad (eds.), Vehicle Routing: Methods and Studies, Studies in Management Science and Systems, Vol. 16, pp. 127–148 Amsterdam: North Holland, 1988.

    Google Scholar 

  • Chisman, J. A., “The clustered traveling salesman problem,” Computers and Operations Research, 2, 115– 119 (1975).

    Article  Google Scholar 

  • Deif, I. and L. Bodin, “Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling,” in Proceedings of the Babson Conference on Software Uses in Transportation and Logistic Management, Babson Park, pp. 75–96, (1984).

  • Dongarra, J. J., “Performance of Various Computers using standard linear equation software,” Technical Report, Computer Science department, University of Tennessee, USA (2002). http://www.netlib.org/benchmark/performance.ps..

  • Durbin, R. and D. Willshaw, “An analogue approach to the traveling salesman problem using elastic net method,” Nature, 326, 689–691 (1987).

    Article  Google Scholar 

  • Fischetti, M., and P. Toth, “An additive bounding procedure for the asymmetric traveling salesman problem,” Mathematical Programming, 53, 173–197 (1992).

    Article  Google Scholar 

  • Fort, J. C., “Solving a combinatorial problem via self-organizing process: An application to the traveling salesman problem,” Biological Cybernetics, 59, 33–40 (1988).

    Article  Google Scholar 

  • Gendreau, G., A. Hertz, and G. Laporte, “New insertion and post-optimization procedures for the traveling salesman problem,” Operations Research, 40, 1086–1094 (1992).

    Google Scholar 

  • Gendreau, G., A. Hertz, and G. Laporte, “The traveling salesman problem with backhauls,” Computers and Operations Research, 23, 501–508 (1996).

    Article  Google Scholar 

  • Ghaziri, H., “Solving routing problem by self-organizing maps,” in T. Kohonen, K. Makisara, O. Simula, and J. Kangas (eds.), Artificial Neural Networks. Amsterdam: North Holand, 1991, pp. 829–834.

    Google Scholar 

  • Ghaziri, H. “Supervision in the self-organizing feature map: Application to the vehicle routing problem,” in I. H. Osman and J. P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Boston: Kluwer Academic publishers, 1996, pp. 651–660.

    Google Scholar 

  • Ghaziri H., and I. Osman, “A neural network algorithm for traveling sales man problem With backhauls,” Computers and Industrial Engineering, 44, 267–281 (2003).

    Article  Google Scholar 

  • Goetschalckx, M., and C. Jacobs-Blecha, “The vehicle routing problem with backhauls,” European Journal of Operational Research, 42, 39–51 (1989).

    Article  Google Scholar 

  • Goetschalckx, M., and C. Jacobs-Blecha, The vehicle routing problem with backhauls: Properties and solution algorithms. Techinical Report MHRC-TR-88-13, Georgia Institute of Technology, 1993.

  • Golden, B., E. Baker, J. Alfaro, and J. Schaffer, “The vehicle routing problem with backhauling: two approaches,” in Proceedings of the XXI Annual Meeting of S. E. Tims, Martle Beach, 1985, pp. 90–92.

  • Hopfield, J. J. and D. W. Tank, “Neural computation of decisions in optimization problem,” Biological Cybernetics, 52, 141–152 (1985).

    Google Scholar 

  • Jongens, K. and T. Volgenant, “The symmetric clustered traveling salesman problem,” European Journal of Operational Research, 19, 68–75 (1985).

    Article  Google Scholar 

  • Kalantari, B., A. V. Hill, and S. R. Arora, “An algorithm for the traveling salesman with pickup and delivery customers,” European Journal of Operational Research, 22, 377–386 (1985).

    Article  Google Scholar 

  • Kennedy, P., RISC Benchmark Scores, 1998. http://kennedyp.iccom.com/riscscore.htm

  • Kohonen, T., “Self-Organized formation of topologically correct feature maps,” Biological Cybernetics, 43, 59–69 (1982).

    Article  Google Scholar 

  • Kohonen, T., Self-Organizing Maps. Berlin: Springer-Verlag, 1995.

    Google Scholar 

  • Laporte, G. and I. H. Osman, “Routing problems: A bibliography,” Annals of Operations Research, 61, 227– 262 (1995).

    Article  Google Scholar 

  • Looi, C.-K., “Neural network methods in combinatorial optimization,” Computers and Operations Research, 19, 191–208 (1992).

    Article  Google Scholar 

  • Lotkin, F. C. J., “Procedures for traveling salesman problems with additional constraints,” European Journal of Operational Research, 3, 135–141 (1978).

    Google Scholar 

  • Mladnovic, N. and P. Hansen, “Variable neighborhood search,” Computers and Operations Research, 24, 1097–1100 (1997).

    Google Scholar 

  • Mladenovic, N., Personal communication, 2001.

  • Modares, A., S. Somhom, and T. Enkawa, “A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems,” International Transactions in Operational Research, 6, 591–606 (1999).

    Article  Google Scholar 

  • Mosheiov, G., “The traveling salesman problem with pickup and delivery,” European Journal of Operational Research, 72, 299–310 (1994).

    Google Scholar 

  • Osman I. H., “An introduction to Meta-heuristics,” in M. Lawrence and C. Wilsdon (eds.), Operational Research Tutorial, pp. 92–122. 1995, Operational Research Society: Birmingham, UK, 1995.

  • Osman, I. H., and G. Laporte, “Meta-heuristics: A bibliography,” Annals of Operations Research, 63, 513– 623 (1996).

    Article  Google Scholar 

  • Osman, I. H., and N. A. Wassan, “A reactive tabu search for the vehicle routing problem with Backhauls,” Journal of Scheduling, Forthcoming (2002).

  • Peng, E., K. N. K. Gupta, and A. F. Armitage, “An investigation into the improvement of local minima of the Hopfield network,” Neural Networks, 9, 1241–1253 (1996).

    Article  Google Scholar 

  • Potvin, J.-Y. “The traveling salesman problem: A neural network perspective,” ORSA Journal on Computing, 5, 328–348 (1993).

    Google Scholar 

  • Potvin, J. Y. and F. Guertin, “The clustered traveling salesman problem: A genetic approach,” in I. H. Osman and J. P Kelly (eds.), Meta-heuristics Theory and Applications. Boston: Kluwers Academic Publishers, 1996, pp. 619– 631.

    Google Scholar 

  • Potvin, J.-Y. and C. Robillard, “Clustering for vehicle routing with a competitive neural network,” Neurocomputing, 8, 125–139 (1995).

    Article  Google Scholar 

  • Renaud, J., F. F. Boctor, and J. Quenniche, “A heuristic for the pickup and delivery traveling problem,” Computers and Operations Research, 27, 905–916 (2000).

    Article  Google Scholar 

  • Smith, K. A. “Neural network for combinatorial optimization: A review of more than a decade of research,” INFORMS Journal on Computing, 11, 15–34 (1999).

    Google Scholar 

  • Thangiah, S. R., J. Y. Potvin, and T. Sung, “Heuristic approaches to the vehicle routing with backhauls and time windows,” Computers and Operations Research, 1043–1057 (1996).

  • Toth, P. and D. Vigo, “A heuristic algorithm for the vehicle routing problem with backhauls,” in Advanced Methods in Transportation Analysis, Bianco L, 1996, pp. 585–608.

  • Toth, P. and D. Vigo, “An exact algorithm for the vehicle routing problem with backhauls,” Transportation Science, 31(4), 372–385 (1997).

    Google Scholar 

  • Toth, P. and D. Vigo, “A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls,” European Journal of Operational Research, 113, 528–543 (1999).

    Article  Google Scholar 

  • Vakhutinsky, A. I. and B. L. Golden, “A hierarchical strategy for solving traveling salesman problems using elastic nets,” Journal of Heuristics, 1, 67–76 (1995).

    Google Scholar 

  • Yano, C., T. Chan, L. Richter, L. Culter, K. Murty, and D. McGettigan, “Vehicle routing at Quality Stores,” Interfaces, 17, 52–63 (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business, American University of Beirut, Bliss Street, Beirut, Lebanon

    Hassan Ghaziri & Ibrahim H. Osman

Authors
  1. Hassan Ghaziri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ibrahim H. Osman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hassan Ghaziri.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ghaziri, H., Osman, I.H. Self-organizing feature maps for the vehicle routing problem with backhauls. J Sched 9, 97–114 (2006). https://doi.org/10.1007/s10951-006-6774-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-006-6774-z

Keywords

Search

Navigation