scholarly journals Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows

Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1625
Author(s):  
Vincent F. Yu ◽  
Winarno ◽  
Achmad Maulidin ◽  
A. A. N. Perwira Redi ◽  
Shih-Wei Lin ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Programming Model ◽  
Time Windows ◽  
Mathematical Programming Model ◽  
Routing Problem ◽  
Path Cover ◽  
Practical Strategy ◽  
Benchmark Datasets ◽  
Restart Strategy ◽  
Cover Problem

This research presents a variant of the vehicle routing problem known as the path cover problem with time windows (PCPTW), in which each vehicle starts with a particular customer and finishes its route at another customer. The vehicles serve each customer within the customer’s time windows. PCPTW is motivated by a practical strategy for companies to reduce operational cost by hiring freelance workers, thus allowing workers to directly service customers without reporting to the office. A mathematical programming model is formulated for the problem. This research also proposes a simulated annealing heuristic with restart strategy (SARS) to solve PCPTW and test it on several benchmark datasets. Computational results indicate that the proposed SARS effectively solves PCPTW.

scholarly journals New general mixed-integer linear programming model for mobile workforce management

2021 ◽  
Author(s):  
András Éles ◽  
István Heckl ◽  
Heriberto Cabezas
Keyword(s):  
Programming Model ◽  
Time Windows ◽  
Mutual Exclusion ◽  
Parallel Execution ◽  
Mixed Integer ◽  
Management Problem ◽  
Routing Problem ◽  
Workforce Management ◽  
Computational Performance ◽  
Wide Range

AbstractA mathematical model is introduced to solve a mobile workforce management problem. In such a problem there are a number of tasks to be executed at different locations by various teams. For example, when an electricity utility company has to deal with planned system upgrades and damages caused by storms. The aim is to determine the schedule of the teams in such a way that the overall cost is minimal. The mobile workforce management problem involves scheduling. The following questions should be answered: when to perform a task, how to route vehicles—the vehicle routing problem—and the order the sites should be visited and by which teams. These problems are already complex in themselves. This paper proposes an integrated mathematical programming model formulation, which, by the assignment of its binary variables, can be easily included in heuristic algorithmic frameworks. In the problem specification, a wide range of parameters can be set. This includes absolute and expected time windows for tasks, packing and unpacking in case of team movement, resource utilization, relations between tasks such as precedence, mutual exclusion or parallel execution, and team-dependent travelling and execution times and costs. To make the model able to solve larger problems, an algorithmic framework is also implemented which can be used to find heuristic solutions in acceptable time. This latter solution method can be used as an alternative. Computational performance is examined through a series of test cases in which the most important factors are scaled.

A Hybrid Meta-Heuristic Algorithm for Vehicle Routing Problem with Time Windows

2015 ◽  
Vol 24 (06) ◽  
pp. 1550021 ◽  
Author(s):  
Esam Taha Yassen ◽  
Masri Ayob ◽  
Mohd Zakree Ahmad Nazri ◽  
Nasser R. Sabar
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Routing Problem

Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.

scholarly journals Hybrid Crow Search Algorithm - Simulated Annealing untuk Menyelesaikan Vehicle Routing Problem with Time Windows

2020 ◽  
Vol 2 (2) ◽  
pp. 97
Author(s):  
Bella Pristianisa Subari ◽  
Asri Bekti Pratiwi ◽  
Herry Suprajitno
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Routing Problem

Penulisan artikel ini bertujuan untuk menyelesaikan permasalahan Vehicle Routing Problem with Time Windows (VRPTW) dengan menggunakan Hybrid Crow Search Algorithm (CSA) dengan Simulated Annealing (SA). Hybrid CSA dengan SA adalah gabungan dari kedua algoritma dengan cara melakukan proses CSA kemudian hasil terburuknya diperbaiki dengan proses SA untuk sepuluh iterasi pertama. Proses algoritma ini dimulai dengan inisialisasi parameter, membangkitkan posisi dan memori awal, menghitung fungsi tujuan, memperbarui posisi gagak, menghitung fungsi tujuan posisi baru gagak, update memori gagak, menentukan solusi terburuk dari posisi gagak kemudian dilakukan modifikasi, hasil modifikasi dengan SA menggantikan solusi terburuk pada posisi gagak, proses berlanjut sampai maksimal iterasi dipenuhi dan menentukan solusi terbaik dari memori gagak. Berdasarkan hasil implementasi pada tiga tipe data dapat disimpulkan  bahwa semakin banyak jumlah iterasi, jumlah gagak, dan proses Simulated Annealing maka nilai fungsi tujuan yang diperoleh cenderung semakin baik, sedangkan nilai probabilitas kewaspadaan (AP) tidak memberikan pengaruh pada solusi permasalahan.

scholarly journals Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

2020 ◽  
Vol 26 (4) ◽  
pp. 174-184
Author(s):  
Thi Diem Chau Le ◽  
Duy Duc Nguyen ◽  
Judit Oláh ◽  
Miklós Pakurár
Keyword(s):  
Mathematical Model ◽  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Distribution Networks ◽  
Mixed Integer ◽  
Vehicle Group ◽  
Real Problem ◽  
Routing Problem

AbstractThis study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.

scholarly journals Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows

2009 ◽  
Vol 3 (2) ◽  
pp. 87-100 ◽  
Author(s):  
Marcin Woch ◽  
Piotr Łebkowski
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Optimization Problems ◽  
Time Windows ◽  
High Quality ◽  
Routing Problem ◽  
Annealing Algorithm ◽  
Very High

This article presents a new simulated annealing algorithm that provides very high quality solutions to the vehicle routing problem. The aim of described algorithm is to solve the vehicle routing problem with time windows. The tests were carried out with use of some well known instances of the problem defined by M. Solomon. The empirical evidence indicates that simulated annealing can be successfully applied to bi-criterion optimization problems.

Sign in / Sign up

Export Citation Format

Share Document