Skip to main content

2013 | OriginalPaper | Buchkapitel

A New Solution Representation for Solving Location Routing Problem via Particle Swarm Optimization

verfasst von : Jie Liu, Voratas Kachitvichyanukul

Erschienen in: Proceedings of the Institute of Industrial Engineers Asian Conference 2013

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents an algorithm based on the particle swarm optimization algorithm with multiple social learning terms (GLNPSO) to solve the capacitated location routing problem (CLRP). The decoding method determines customers clustering followed by depot location and ends with route construction. The performance of the decoding method is compared with previous work using a set of benchmark instances. The experimental results reveal that proposed decoding method found more stable solutions that are clustered around the best solutions with less variation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Ai TJ, Kachitvichyanukul V (2008) A study on adaptive particle swarm optimization for solving vehicle routing problems. Paper in the APIEMS 2008 conference. Bali, Dec 2008 Ai TJ, Kachitvichyanukul V (2008) A study on adaptive particle swarm optimization for solving vehicle routing problems. Paper in the APIEMS 2008 conference. Bali, Dec 2008
Zurück zum Zitat Averbakh I, Berman O (1994) Routing and location-routing p-delivery men problems on a path. Transp Sci 28:184–197MathSciNetCrossRef Averbakh I, Berman O (1994) Routing and location-routing p-delivery men problems on a path. Transp Sci 28:184–197MathSciNetCrossRef
Zurück zum Zitat Bruns AD (1998) Zweistufige Standortplanung unter Beru¨ cksichtigung von Tourenplanungsaspekten—Primale Heuristiken und Lokale Suchverfahren. Ph.D dissertation, Sankt Gallen University Bruns AD (1998) Zweistufige Standortplanung unter Beru¨ cksichtigung von Tourenplanungsaspekten—Primale Heuristiken und Lokale Suchverfahren. Ph.D dissertation, Sankt Gallen University
Zurück zum Zitat Duhamel C, Lacomme P, Prins C, Prodhon C (2008) A memetic approach for the capacitated location routing problem. Paper presented in the EU/meeting 2008 workshop on metaheuristics for logistics and vehicle routing. France, 23–24 Oct 2008 Duhamel C, Lacomme P, Prins C, Prodhon C (2008) A memetic approach for the capacitated location routing problem. Paper presented in the EU/meeting 2008 workshop on metaheuristics for logistics and vehicle routing. France, 23–24 Oct 2008
Zurück zum Zitat Ghosh JK, Sinha SB, Acharya D (1981) A generalized reduced gradient based approach to round-trip location problem. Sci Manage Transp Systems 209–213 Ghosh JK, Sinha SB, Acharya D (1981) A generalized reduced gradient based approach to round-trip location problem. Sci Manage Transp Systems 209–213
Zurück zum Zitat Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur J Oper Res 6:224–226MATHCrossRef Laporte G, Nobert Y (1981) An exact algorithm for minimizing routing and operating costs in depot location. Eur J Oper Res 6:224–226MATHCrossRef
Zurück zum Zitat Laporte G, Nobert Y, Arpin D (1986) An exact algorithm for solving a capacitated location-routing problem. Ann Oper Res 6:291–310CrossRef Laporte G, Nobert Y, Arpin D (1986) An exact algorithm for solving a capacitated location-routing problem. Ann Oper Res 6:291–310CrossRef
Zurück zum Zitat Liu J, Kachitvichyanukul V (2012) Particle swarm optimization for solving location routing problem. In: Proceedings of the 13th Asia pacific industrial engineering and management systems conference. Phuket, Thailand, pp 1891–1899, Dec 2012 Liu J, Kachitvichyanukul V (2012) Particle swarm optimization for solving location routing problem. In: Proceedings of the 13th Asia pacific industrial engineering and management systems conference. Phuket, Thailand, pp 1891–1899, Dec 2012
Zurück zum Zitat Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. Eur J Oper Res 108:1–15MATHCrossRef Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. Eur J Oper Res 108:1–15MATHCrossRef
Zurück zum Zitat Nguyen S, Ai TJ, Kachitvichyanukul V (2010) Object library for evolutionary techniques ETLib: user’s guide. High Performance Computing Group, Asian Institute of Technology, Thailand Nguyen S, Ai TJ, Kachitvichyanukul V (2010) Object library for evolutionary techniques ETLib: user’s guide. High Performance Computing Group, Asian Institute of Technology, Thailand
Zurück zum Zitat Pongchairerks P, Kachitvichyanukul V (2009) Particle swarm optimization algorithm with multiple social learning structures. Int J Oper Res 6(2):176–194MathSciNetCrossRef Pongchairerks P, Kachitvichyanukul V (2009) Particle swarm optimization algorithm with multiple social learning structures. Int J Oper Res 6(2):176–194MathSciNetCrossRef
Zurück zum Zitat Prins C, Prodhon C, Calvo RW (2006a) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. Q J Oper Res 4(3):221–238MathSciNetMATHCrossRef Prins C, Prodhon C, Calvo RW (2006a) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. Q J Oper Res 4(3):221–238MathSciNetMATHCrossRef
Zurück zum Zitat Prins C, Prodhon C, Calvo RW (2006b) A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. EvoCOP 2006:183–194 Prins C, Prodhon C, Calvo RW (2006b) A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. EvoCOP 2006:183–194
Zurück zum Zitat Wu TH, Low C, Bai JW (2002) Heuristic solutions to multi-depot location-routing problems. Comput Oper Res 29:1393–1415MATHCrossRef Wu TH, Low C, Bai JW (2002) Heuristic solutions to multi-depot location-routing problems. Comput Oper Res 29:1393–1415MATHCrossRef
Metadaten
Titel
A New Solution Representation for Solving Location Routing Problem via Particle Swarm Optimization
verfasst von
Jie Liu
Voratas Kachitvichyanukul
Copyright-Jahr
2013
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-4451-98-7_12