scholarly journals Traveling salesman problem: approach to optimality

2014 ◽  
Vol 15 (2) ◽  
pp. 157-169
Author(s):  
Radosław Jadczak
Keyword(s):  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Decision Problem ◽  
Mathematical Formulation ◽  
Traveling Salesman ◽  
Chinese Postman Problem ◽  
Routing Problem ◽  
Solution Strategies ◽  
Chinese Postman ◽  
Single Vehicle

Abstract Traveling Salesman Problem (TSP) is a basic and one of the most important transportation problems in operational logistics. It is also known in the literature as a Chinese postman problem or single vehicle routing problem. TSP can be shortly described as follows. Vehicle starting from the selected city must visit a set of another cities exactly once and return to the starting city in such a way that the total distance of the route is minimized. In this paper first mathematical formulation of decision problem is presented. Then solution strategies of TSP are shown with selected algorithms as examples. In the last part of article, a computational results of selected methods are presented.

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 82-92 ◽  
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

An algorithm for the capacitated vehicle routing problem for picking application in manual warehouses

2019 ◽  
Author(s):  
Eleonora Bottani ◽  
Giorgia Casella ◽  
Caterina Caccia ◽  
Roberto Montanari
Keyword(s):  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Order Picking ◽  
Traveling Salesman ◽  
Manhattan Distance ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Termination Criteria ◽  
Capacitated Vehicle

Given that warehouses play a central role in modern supply chains, this study proposes the application of an algorithm for the capacitated vehicle routing problem (CVRP) based on the two-index vehicle flow formulation developed by Baldacci, Hadjiconstantinou, and Mingozzi (2004) for picking purposes in manual warehouses. The study of Theys et al. (2010) is first used to represent the warehouse using a Steiner traveling salesman problem (TSP). Then, a calculation of the picking tour’s length is obtained applying the Manhattan distance. Finally, the algorithm for the CVRP is solved through a cutting plane with the addition of termination criteria related to the capacity of picker. The study analyzes four different warehouse configurations, processing five picking list each. The analysis is carried out exploiting the commercial software MATLAB®, to determine the solution that minimize distance of the order picking tour. The results obtained in MATLAB® show the effectiveness of the chosen algorithm applied to the context of manual order picking.

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2012 ◽  
pp. 342-352
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Exact Algorithms ◽  
Traveling Salesman ◽  
Routing Problem ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

A Clarke and Wright Improved Algorithm to Solve the Vehicle Routing and Traveling Salesman Problem

2016 ◽  
Vol 8 (1) ◽  
pp. 35
Author(s):  
Mamoon Alameen ◽  
Rasha Aljamal ◽  
Sadeq Damrah
Keyword(s):  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Traveling Salesman ◽  
Exact Methods ◽  
Routing Problem ◽  
Cpu Time ◽  
Shortest Distance ◽  
Transportation Scheduling ◽  
The Given

Vehicle Routing Problem (VRP) and Traveling Salesman Problem (TSP) are well known transportation problems. The problems can be seen in all the industries that involves goods distribution and transportation scheduling. Finding the shortest distance with respect to the given constraint contribute highly to save money and energy consumption. This paper investigates the possibility of creating a cellular application that can provide an instant routing plan through a simple heuristic (Clarke and Wright) in order to avoid the usage of more complicated approaches as metaheuristics and exact methods that normally taking very long CPU time.

scholarly journals Optimization for medical logistics robot based on model of traveling salesman problems and vehicle routing problems

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110225
Author(s):  
Hui Jin ◽  
Qingsong He ◽  
Miao He ◽  
Shiqing Lu ◽  
Fangchao Hu ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Order Picking ◽  
Traveling Salesman ◽  
Vehicle Routing Problems ◽  
Traveling Salesman Problems ◽  
Routing Problem ◽  
Problem Model ◽  
Route Length

Fast medicine dispensing system (FMDS) as a kind of medical logistic robot can dispense many drugs for one prescription at the same time. To guarantee the sustainability of drug dispensation, it is required that FMDS replenish drugs rapidly. The traditional order picking model (OPM) is difficult to meet the demand of prompt replenishment. To solve the problems of prolonged refilling route and inefficiency of drugs replenishment, a mixed refilling model based on multiple steps traveling salesman problem model (MTSPM) and vehicle routing problem model (VRPM) is proposed, and it is deployed in two circumstances of FMDS, including temporary replenishment mode (TRM) and concentrate replenishment mode (CRM). It not only meted the demand under different circumstances of drug replenishment but also shortened the refilling route significantly. First, the new pick sets were generated. Then, the orders of pick sets were optimized and the new paths were achieved. When the number of pickings is varied no more than 20, experiment results declared that the refilling route is the shortest by utilizing MTSPM when working under the TRM condition. Comparing MTSPM with OPM, the rate of refilling route length decreased up to 32.18%. Under the CRM condition, the refilling route is the shortest by utilizing VRPM. Comparing VRPM with OPM, the rate of refilling route length decreased up to 58.32%. Comparing VRPM with MTSPM, the rate of refilling route length has dropped more than 43.26%.

Sign in / Sign up

Export Citation Format

Share Document