A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit

Polat, Olcay; Kalaycı, Can Berk; Kulak, Osman; Günther, Hans‐Otto

doi:10.1016/j.ejor.2014.10.010

Cited by 125 publications

(81 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Therefore, each solution obtained via the shaking phase is used in the local search phase in order to explore new promising neighbourhoods of the current solution. In the local search phase of VNS, a variable neighbourhood descent (VND) procedure combines the set of neighbourhoods in a deterministic way, since using more than one neighbourhood structure could result in a better solution (Hansen and Mladenović 2001;Polat et al 2015). In the literature, two common strategies exist for searching neighbourhoods in VND procedure: sequential and nested (Hansen, Mladenović, and Moreno Pérez 2010).…”

Section: The Proposed Methodologymentioning

confidence: 99%

A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study

Polat

Kalaycı

Özcan

et al. 2015

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

The assembly line worker assignment and balancing problem type-II (ALWABP-2) occurs when workers and tasks (where task times depend on workers' skills) are to be simultaneously assigned to a fixed number of workstations with the goal of minimising the cycle time. In this study, a two-phase variable neighbourhood search (VNS) algorithm is proposed to solve the ALWABP-2 due to the NP-hard nature of this problem. In the first phase of the algorithm, a VNS approach is applied to assign tasks to workstations with the aim of minimising the cycle time while in the second phase, a variable neighbourhood descent method is applied to assign workers to workstations. The performance of the proposed algorithm is tested on well-known benchmark instances. In addition, the proposed algorithm has been used to solve a real case study from a consumer electronics company that manufactures LCD TVs. The results show that the algorithm is superior to the methods reported in the literature in terms of its higher efficiency and robustness. Furthermore, the algorithm is easy to implement and significantly improves the performance of the final assembly line for the investigated LCD TV real case study.

show abstract

Section: The Proposed Methodologymentioning

confidence: 99%

A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study

Polat

Kalaycı

Özcan

et al. 2015

International Journal of Production Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…Δ a ) is provided for those instance sets for which this measure is available for the large majority of comparison algorithms. The BKS for the benchmarks Salhi‐VRPSPD and Dethloff are taken from Subramanian et al , for the benchmarks Montané‐Medium, Montané‐All, and Salhi‐VRPSPDTL from Subramanian et al , and for the benchmark Polat‐VRPSPDTL from Polat et al .…”

Section: Computational Studiesmentioning

confidence: 99%

“…in the table) and the run‐time is based on the time elapsed when the best solution was found. The results of SDBOF (Subramanian, Drummond, Bentes, Ochi, and Farias ) are based on 50 runs performed by 256 parallel threads and the average time per run. For GKA (Goksal, Karaoglan, and Altiparmak ), VCGP (Vidal, Crainic, Gendreau, and Prins ), SUO (Subramanian, Uchoa, and Ochi ), and KK (Kalayci and Kaya ), the table provides results based on 10 runs and the average time per run. P (Polat ) uses six parallel threads and performs 10 runs. The run‐time is based on the average time required to obtain the best solution reported. For PKKG (Polat, Kalayci, Kulak, and Günther ), the results are based on 10 runs and the time of the best run for benchmarks Salhi‐VRPSPD and Salhi‐VRPSPDTL, and on the average time per run for benchmark Polat‐VRPSPDTL. The results reported for ALNS‐PR are based on 10 runs and the average time per run.…”

Section: Computational Studiesmentioning

confidence: 99%

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

Hof

Schneider

2019

Networks

View full text Add to dashboard Cite

We study a class of vehicle‐routing problems with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (1) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transportation vehicles, (2) the VRPSPD with time windows (VRPSPDTW), which takes customer time windows into account, (3) the VRP with divisible deliveries and pickups (VRPDDP), which allows for fulfilling the delivery and pickup requests of each customer in two separate visits, (4) the previously unstudied VRP with restricted mixing of divisible deliveries and pickups (VRPRMDDP), which accounts for the difficulty of rearranging the vehicle load by additionally requiring that a certain percentage of the vehicle capacity must remain unoccupied when both types of demand are simultaneously loaded, and (5) the previously unstudied VRPDDP with time windows (VRPDDPTW). We develop a hybrid heuristic solution method which combines an adaptive large neighborhood search algorithm with a path relinking approach, called ALNS‐PR, and we demonstrate the competitiveness of our algorithm on benchmark instances proposed in the literature. Especially on VRPSPDTL, VRPSPDTW, and VRPDDP instances, our ALNS‐PR proves to be superior to the majority of comparison algorithms and is able to obtain numerous new best solutions.

show abstract

“…An adaptive perturbation mechanism is applied to escape from local optima. For details of the algorithm see (Polat et al 2014;Polat et al 2015;Polat et al 2012b). Main output of the heuristic solution algorithm is the composition of the fleet of vehicles and the service routes and their frequency.…”

Section: Jtlmentioning

confidence: 99%

The impact of seasonal demand fluctuations on service network design of container feeder lines

Polat¹,

Günther²

2016

Journal of Transportation and Logistics

Self Cite

View full text Add to dashboard Cite

Customer demand in global supply networks is highly uncertain due to unexpected global and local economic conditions and, in addition, affected by seasonal demand fluctuations for final products. Therefore, the design of shipping services for containerized goods has to prove its economic efficiency under varying conditions of transportation demand. Since liner shipping involves significant capital investments and huge daily operating costs, the appropriate design of the service network is crucial for the profitability of the container feeder lines. Usually, quantitative models used for shipping network design are based on deterministic forecasts, which are prone to errors caused by uncertainty factors and structural changes in the development of demand. This study puts special emphasis on the impact of seasonal demand fluctuations on the structure of the related service networks, the capacity of the fleet operating within the network, the deployment of ship types as well as on the associated routes of the ships. A simulation and artificial neural network based forecasting framework is developed to support the design of service networks of feeder shipping lines. The proposed methodology has been tested for a feeder shipping service in the East Mediterranean and Black Sea region. Numerical results show that seasonal demand fluctuations have vital impact on the network design of feeder lines.

show abstract

A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit

Cited by 125 publications

References 38 publications

A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study

A two-phase variable neighbourhood search algorithm for assembly line worker assignment and balancing problem type-II: an industrial case study

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

The impact of seasonal demand fluctuations on service network design of container feeder lines

Contact Info

Product

Resources

About