Traveling salesman problem heuristics: Leading methods, implementations and latest advances

Rego, César; Gamboa, Dorabela; Glover, Fred; Osterman, Colin

doi:10.1016/j.ejor.2010.09.010

Cited by 200 publications

(104 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Being very flexible, this approach can be used according to the character of data. The travelling salesman problem was solved with the known from the literature variants of NN (Nearest Neighborhood) methods (Gandreau et al 2006;Peng 2011;Regoa et al 2011).…”

Section: Heuristic For Solving Cvrppadmentioning

confidence: 99%

Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

Sitek

Wikarek

2017

Ann Oper Res

View full text Add to dashboard Cite

The paper presents an optimization model and its implementation using a hybrid approach for the Capacitated Vehicle Routing Problem with Pick-up and Alternative Delivery (CVRPPAD). The development of the CVRPPAD was motivated by postal items distribution issues. The model proposed combines various features of Vehicle Routing Problem variants. The novelty of this model lies in the introduction of alternativeness of item delivery points, differentiation of delivery point types in terms of their capacity (parcel lockers) and possibility of collecting the items during the execution of delivery routes. The model also takes into account a possibility of introducing time windows related to delivery time. The proposed data structure in the form of sets of facts facilitates the implementation of the model in all environments, Constraint Logic Programming (CLP), Mathematical Programming (MP), metaheuristics, databases, etc. The model is implemented in the MP, hybrid CLP/MP, and hybrid CLP/heuristic environments. The hybrid CLP/MP approach is the authors' original solution, which has already been used to solve Supply Chain Management problems, scheduling problems, routing problems etc. For large size problems, considering their combinatorial character, the proposed CLP/MP approach is ineffective. Its effectiveness will improve when MP is replaced by a heuristic. All implementations were performed on the same data instances (facts), which made it possible to compare them according to the solution search time, number of decision variables and number of constraints. The directions into which the model can be further developed were also presented.

show abstract

Section: Heuristic For Solving Cvrppadmentioning

confidence: 99%

Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

Sitek

Wikarek

2017

Ann Oper Res

View full text Add to dashboard Cite

show abstract

“…Research has led to a plethora of algorithms and heuristics that provide approximate or (near) exact solutions to optimization problems like bin and strip packing (Lodi et al 2002, Jylänki 2010 or the well-known traveling salesman problem (Rego et al 2011). While there still is a growing demand in industry for automated solutions to single optimization problems, recently, combinations of several optimization problems gain increased interest, as they bear high potential for savings (Hasle & Kloster 2007).…”

Section: Related Workmentioning

confidence: 99%

Interactive Human-Guided Optimization for Logistics Planning

Mattar¹,

Kulms²,

Kopp³

2015

Mensch Und Computer 2015 – Tagungsband

View full text Add to dashboard Cite

Logistics planning is an important problem in industry, where goods have to be parceled appropriately to meet delivery dates or reduce shipping costs. This optimization problem is classically solved offline using standard algorithms and focused heuristics, e.g. bin packing or route planning. However, in practical work environments, constraints may change flexibly and it is often not clear what an optimal solution looks like. Further, logistics planning consists of multiple steps that often are handled by different human employees in different departments. In this paper we propose an interactive approach using human-guided optimization, where solution spaces can be interactively explored, manipulated, and constrained at runtime. Based on an analysis of the problem of multi-step logistics planning, we present a system that supports users in solving this optimization problem, and we report first evaluation results obtained in the first two iterations of a user-centered design process.

show abstract

“…Akan tetapi, permasalahan optimalisasi yang akan diangkat tidaklah mudah untuk dapat diselesaikan (Gharan, Saberi, & Singh, 2011). Pokok permasalahan di sini ialah bagaimana meminimalkan total biaya di mana total biaya merupakan hasil dari perhitungan biaya yang dibutuhkan untuk melakukan perjalanan dari suatu tempat dengan melewati semua tempat tujuan tepat satu kali dan kembali ke tempat semula (Rego, Gamboa, Glover, & Osterman, 2011).…”

Section: Pendahuluanunclassified

Aplikasi Hybrid Firefly Algorithm untuk Pemecahan Masalah Traveling Salesman: Studi Kasus pada PT Anugerah Mandiri Success

Sudirwan

Fadlilah

Teguh

2014

ComTech

View full text Add to dashboard Cite

show abstract

Traveling salesman problem heuristics: Leading methods, implementations and latest advances

Cited by 200 publications

References 23 publications

Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

Interactive Human-Guided Optimization for Logistics Planning

Aplikasi Hybrid Firefly Algorithm untuk Pemecahan Masalah Traveling Salesman: Studi Kasus pada PT Anugerah Mandiri Success

Contact Info

Product

Resources

About