Knowledge-guided local search for the vehicle routing problem

Arnold, Florian; Sörensen, Kenneth

doi:10.1016/j.cor.2019.01.002

Cited by 81 publications

(80 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Penalty is the indicator involving the feature i, which is the distance between customer location and other locations, and λ, a parameters to GLS, represents the relative value of penalties to control the information on the search process with respect to the actual solution cost. Arnold and Sörensen [2019] found that λ = 0.1 works well.…”

Section: Local Searchmentioning

confidence: 97%

“…We found the method to improve the operators in the steepest descent search strategy to avoid the local optima for reaching global optima as with the guided local search (GLS) algorithm [Kibly et al, 1999]. To probably improve the efficiency of the solutions in the search process, Guided local search (GLS) is an optimization technique which is an intelligent search algorithm that exploits information to guide the local search in avoiding the local optimum [Voudouris, 1997;Voudouris et al, 2010;Kilby et al, 1999;Arnold and Sörensen, 2019]. The GLS solution modifies action from local search by augmented cost function of minimizing the problem objective function with the cost function to a penalty term that was applied by a penalty vector p, where pi is the penalty value of feature i.…”

Section: Local Searchmentioning

confidence: 99%

See 1 more Smart Citation

Bike-sharing rebalancing problem

Boonjubut

Hasegawa

Kongwat

2021

JGTR

View full text Add to dashboard Cite

The number of bike-sharing services has rapidly increased in many cities worldwide. One of the main challenges of the bike-sharing system operation costs is allocating enough bikes and parking space. This paper presents a model for solving the bike-sharing relocation problem. The artificial bee colony (ABC) algorithm is an efficient approach, but it is still insufficient for the selection strategy. ABC has been adopted in various problems to improve the performance of various systems. This research proposed a modified ABC algorithm in a neighbor solution to enhance the solution performance, namely guided local search (GLS), to apply to the design route for transportation while truck relocation bikes each station in the bike-sharing system. Computational experiments were performed to find out the best modeling solution in the case. The implementations were experimental for the same data instances, which made it possible to compare the performance algorithms so as to solve the bike-sharing relocation problem of the pickup and drop off. The results showed that the GLS-ABC method can be a better solution than the original one. The statistically significant p-value of the mean objective value of the different algorithms was smaller than 0.05. Thus, the impact of minimizing the route tour cost in solving the bike-sharing relocation problem.

show abstract

Section: Local Searchmentioning

confidence: 97%

Section: Local Searchmentioning

confidence: 99%

Bike-sharing rebalancing problem

Boonjubut

Hasegawa

Kongwat

2021

JGTR

View full text Add to dashboard Cite

show abstract

“…It was initially proposed by [15] and later applied to CVRP by [16]. According to [17], this method is memory-based as it determines and penalizes "ineffective" edges by increasing its cost to a new * , = , + ,…”

Section: Guided Local Search (Gls)mentioning

confidence: 99%

Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study

Mikchailovitch¹,

Nikolaevna²

2019

Proceedings of ISP RAS

View full text Add to dashboard Cite

This study is concerned with local search metaheuristics for solving Capacitated Vehicle Routing Problem (CVRP). In this problem the optimal design of routes for a fleet of vehicles with a limited capacity to serve a set of customers must be found. The problem is NP-hard, therefore heuristic algorithms which provide near-optimal polynomial-time solutions are still actual. This experimental analysis is a continue of previous research on construction heuristics for CVRP. It was investigated before that Clarke and Wright Savings (CWS) heuristic is the best among constructive algorithms except for a few instances with geometric type of clients' distribution where Nearest Neighbor (NN) heuristic is better. The aim of this work is to make a comparison of best-known local search metaheuristics by criteria of error rate and running time with CWS or NN as initial algorithms because there were not found any such state-of-the-art comparative study. An experimental comparison is made using 8 datasets from well-known library because it is interesting to analyze "effectiveness" of algorithms depending on type of input data. Overall, five different groups of Pareto optimal algorithms are defined and described. Эвристические методы конструирования маршрута для решения задачи маршрутизации с ограничением по грузоподъемности С.М. Авдошин, ORCID: 0000-0001-8473-8077 Е.Н. Береснева, ORCID: 0000-0001-6710-2843 Департамент программной инженерии, Национальный исследовательский университет «Высшая школа экономики», 101000, Россия, г. Москва, ул. Мясницкая, д. 20. Аннотация. Задача маршрутизации -одна из широко известных задач комбинаторной оптимизации. Она состоит в отыскании оптимального множества маршрутов для транспортных средств с целью однократного обслуживания определенного множества клиентов. В данной работе исследуется подвид задачи маршрутизации -задача маршрутизации с ограничением по грузоподъемности, в которой каждое транспортное средство имеет свою грузоподъемность. Задача является NP-трудной, поэтому вместо точных алгоритмов решения исследуются только эвристические алгоритмы, позволяющие получить приближенные решения за полиномиальное время. Данная работа является продолжением исследования, посвященного алгоритмам конструирования маршрута; оно позволяет получить первоначальные решения для данной задачи. Было выяснено, что эвристика Clarke and Wright Savings Avdoshin S.M., Beresneva E.N. Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study. Trudy ISP RAN/Proc. ISP RAS, vol. 21, issue 4, 2019, pp. 121-138 122 (CWS) является одной из лучших, за исключением наборов данным с геометрическим расположением точек, для которых лучшим является алгоритм Nearest Neighbor (NN). Целью работы является сравнение локально-оптимальных метаэвристических алгоритмов решения задачи маршрутизации с ограничением по грузоподъемности по двум критериям: точность и время решения, для получения начального решения используются алгоритмы CWS и NN. Выявлено пять Парето оптимальных г...

show abstract

“…It is capable of obtaining more solutions by escaping from the local minima in a wider solution space. Arnold et al [16] combined three powerful local search techniques, and implemented them in an efficient way. In their work, experiments have been made to determine how local search can be effec-tively combined with perturbation and pruning and how to guide the search to better solutions.…”

Section: Introductionmentioning

confidence: 99%

Metaheuristic for Solving Multi-Objective Job Shop Scheduling Problem in a Robotic Cell

Yang

Zhao

et al. 2020

IEEE Access

View full text Add to dashboard Cite

This paper deals with the multi-objective job shop scheduling problem in a robotic cell (MOJRCSP). All the jobs are processed according to their operations order on workstations. Different from classical job shop scheduling problem, the studied problem considers that jobs' transportation is handled by a robot. Also, the jobs are expected to be finished in a time window, instead of a constant due date. A mixed Integer Programming (MIP) model is proposed to formulate this problem. Due to the special characteristics of the studied problem and its NP-hard computational complexity, a metaheuristic based on Teaching Learning Based Optimization (TLBO) algorithm has been proposed. The proposed algorithm determines simultaneously the operations' assignments on workstations, the robot assignments for transportation operations, and the robot moving sequence. The objective is to minimize the makespan and the total earliness and tardiness. Computational results further validated the effectiveness and robustness of our proposed algorithm.

show abstract

Knowledge-guided local search for the vehicle routing problem

Cited by 81 publications

References 35 publications

Bike-sharing rebalancing problem

Bike-sharing rebalancing problem

Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study

Metaheuristic for Solving Multi-Objective Job Shop Scheduling Problem in a Robotic Cell

Contact Info

Product

Resources

About