An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem

Emeç, Uğur; Çatay, Bülent; Bozkaya, Burçin

doi:10.1016/j.cor.2015.11.008

Cited by 57 publications

(34 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To solve the routing problem, namely the CVRP‐PD‐TW, with this cost matrix and daily demand values, a metaheuristic algorithm is employed. Specifically, we use the ALNS algorithm developed by Emec et al that was shown to give near‐optimal solutions in short time for large instances, but we again note that any other suitable solution algorithm may also be put into use.…”

Section: Solution Methodologymentioning

confidence: 99%

“…Our path selection algorithm considers a history of the paths taken by the armored trucks over a number of days and randomly selects paths from a set of previously defined paths. We then convert the distance and risk objectives to a weighted sum, i.e., the routing cost for each O‐D pair, and make use of the Adaptive Large Neighborhood Search (ALNS) heuristic of Emec et al to solve the daily routing problem, namely CVRP‐PD‐TW. We apply our methodology on a data set that we have obtained from a CIT provider operating in an industrial and urban region of Turkey.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An adaptive and diversified vehicle routing approach to reducing the security risk of cash‐in‐transit operations

2017

Self Cite

View full text Add to dashboard Cite

We consider the route optimization problem of transporting valuables in cash-in-transit (CIT) operations. The problem arises as a rich variant of the capacitated vehicle routing problem (CVRP) with time windows and pickup and deliveries. Due to the high-risk nature of this operation (e.g., robberies) we consider a bi-objective function where we attempt to minimize the total transportation cost and the security risk of transporting valuables along the designed routes. For risk minimization, we propose a composite risk measure that is a weighted sum of two risk components: (i) following the same or very similar routes, and (ii) visiting neighborhoods with low socioeconomic status along the routes. We also consider vehicle capacities in terms of monetary value carried as per insurance regulations. We develop an adaptive randomized bi-objective path selection algorithm that uses the composite risk measure in choosing alternative paths between origin-destination pairs over a sequence of days. We solve the rich CVRP approximately for each day with updated costs. We test our solution approach on a data set from a CIT delivery service provider and provide insights on how the routes diversify daily. Our approach generates a spectrum of solutions with costrisk trade-off to support decision making.

show abstract

Section: Solution Methodologymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An adaptive and diversified vehicle routing approach to reducing the security risk of cash‐in‐transit operations

2017

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the literature, vehicle routing problems can be structured differently according to various constraints, such as capacitated VRP [120][121][122][123][124][125][126], the VRP with heterogeneous fleet of vehicles [127], open VRP [128][129][130][131], VRP with time windows [132][133][134][135][136][137][138], VPR with both pick-up and delivery [139][140][141][142][143][144], location routing problem [145][146][147], period VRP [148][149][150][151], multidepot VRP [152][153][154][155][156], VRP with backhaul [157][158][159], inventory routing problem [160][161][162][163], dynamic VRP [164], or the mixture [165][166]…”

Section: Vrpmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

“…ALNS has been developed to solve mostly network problems such as VRP, and it is very flexible when it comes to designing algorithms to solve the proposed problems, as shown in Aksen [34] and Emec et al [37]. The proposed problem is the heterogeneous fleets vehicle routing problem with excessive demand of the vehicle at the pickup point, and the longest time constraint (HFVRP-EXDE-LTC), whereby the new, modified DE algorithm and ALNS were designed to solve this new class of VRP.…”

Section: Introductionmentioning

confidence: 99%

“…Azi et al [36] proposed an ALNS for solving a VRP with multiple routes (VRPM). Emec et al [37] presented new removal, insertion, and vendor selection allocation mechanisms. Ribeiro and Laporte [38] proposed an ALNS for solving the cumulative capacitated vehicle routing problem (CCVRP).…”

Section: Introductionmentioning

confidence: 99%

Heuristics Algorithms for a Heterogeneous Fleets VRP with Excessive Demand for the Vehicle at the Pickup Points, and the Longest Traveling Time Constraint: A Case Study in Prasitsuksa Songkloe, Ubonratchathani Thailand

Kaewman

Akararungruangkul

2018

Logistics

View full text Add to dashboard Cite

This paper presents a methodology to solve a special case of the vehicle routing problem (VRP) called the heterogeneous fleets VRP with excessive demand of the vehicle at the pickup points, and the longest time constraint (HFVRP-EXDE-LTC). We developed two metaheuristics-a differential evolution (DE) algorithm and an adaptive large neighborhood search (ALNS)-to solve the problem. These two proposed methods have been designed to effectively solve a special case of VRP. From the computational results, we can see that the proposed heuristics outperformed the best practices that are currently in use. The DE yielded a 9.78% lower cost than that of the current practice (757,250 baht per year), while ALNS generated a 10.89% (906,750 baht per year) lower cost than that of current practice. Comparing the proposed heuristics, ALNS achieved a 1.01% lower cost than that of DE, as ALNS had a better mechanism that was designed to escape from the local optimal.

show abstract

An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem

Cited by 57 publications

References 42 publications

An adaptive and diversified vehicle routing approach to reducing the security risk of cash‐in‐transit operations

An adaptive and diversified vehicle routing approach to reducing the security risk of cash‐in‐transit operations

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Heuristics Algorithms for a Heterogeneous Fleets VRP with Excessive Demand for the Vehicle at the Pickup Points, and the Longest Traveling Time Constraint: A Case Study in Prasitsuksa Songkloe, Ubonratchathani Thailand

Contact Info

Product

Resources

About