Probabilistic time-dependent vehicle routing problem

Režnar, Tomáš; Martinovič, Jan; Slaninová, Kateřina; Grakova, Ekaterina; Vondrák, Vít

doi:10.1007/s10100-016-0459-2

Cited by 7 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to many depots involved, decision-makers faced challenges in identifying appropriate depots that ability to serve the customers without exceeding the capacity constraints (Calvet et al, 2016). MDVRP also have many sub-variants such as time window, heterogeneous fleet, capacitated, periodic, pick-up and delivery and split delivery (Režnar et al, 2017). Figure 1 shows an illustration of MDVRP with two depots and 22 customers.…”

Section: Multi-depot Vehicle Routing Problem (Mdvrp)mentioning

confidence: 99%

A Review of Single and Population-Based Metaheuristic Algorithms Solving Multi Depot Vehicle Routing Problem

Samsuddin

Othman

Yusuf

2018

IJSECS

View full text Add to dashboard Cite

Multi-Depot Vehicle Routing Problem (MDVRP) arises with rapid development in the logistics and transportation field in recent years. This field, mainly, faces challenges in arranging their fleet efficiently to distribute the goods to customers by minimizing distance and cost. Therefore, the decision maker needs to specify the vehicles to reach the particular depot which, serves the customers with the predetermined capacity. Hence, to solve the stated problems, there is a need to apply metaheuristic methods to get minimal transportation costs. This article reviews on single and population-based metaheuristic methods solving MDVRP from the year 2013 until 2018. The methods discussed were simulated annealing (SA), variable neighborhood search (VNS), ant colony algorithm (ACO), particle swarm optimization (PSO) and genetic algorithm (GA). From the previous works, it can be concluded that the application of populationbased metaheuristic gives better solutions in solving MDVRPs.

show abstract

Section: Multi-depot Vehicle Routing Problem (Mdvrp)mentioning

confidence: 99%

A Review of Single and Population-Based Metaheuristic Algorithms Solving Multi Depot Vehicle Routing Problem

Samsuddin

Othman

Yusuf

2018

IJSECS

View full text Add to dashboard Cite

show abstract

“…Another heuristics, adaptive large neighborhood search algorithm, is experimentally studied on the probabilistic time-dependent vehicle routing problem searching near optimal routes for fleet of vehicles visiting customers within given time windows. When a novel product is introduced on the market, it is quite complicated to define probabilities or even probability-like quantities to forecast the future demand (Režnar et al 2016). A novel approach to handle the situation taking into account the decision maker's attitude towards risk and the dispersion of the payoffs connected with particular order quantities is studied in Gaspars-Wieloch (2016).…”

mentioning

confidence: 99%

Editorial

Povh

Stirn

Žerovnik

2017

Cent Eur J Oper Res

View full text Add to dashboard Cite

This special issue brings peer reviewed selection of results presented at 13th International Symposium on Operations Research, SOR'15, that took place in Bled, Slovenia in September [23][24][25] 2015. The participants at this conference came from many countries but the majority was from Central Europe. In nearly hundred talks, they have presented state-of-the-art results in several emerging areas, like complex networks, high performance computing and big data analysis. Beside these issues, new results in traditional areas like inventory planning, econometric modelling, multi-criteria decision making and mathematical programming were presented.The talks were supported by publications of short, at most 6 pages long, papers printed in the conference proceedings (Zadnik Stirn et al. 2015), which finally contained 93 papers/abstracts written by 191 authors. All authors were also invited to submit the extended and modified version of conference papers or new scientific papers covering topics in operations research for a special issue of Central European Journal of Operations Research by January 31, 2016. Although, the call was open at the conference SOR'15, the submissions that were not necessarily presented at the conference were welcomed as well. In the due time 15 papers were received and a peer review process according to highest academic standards started. After several rounds of major and minor revisions the editorial board of guest editors accepted 12 papers for publication in this special issue.The accepted papers cover wide range of applications: multi-criteria decision making, heuristics and meta-heuristics, routing and scheduling problems and new approaches to solve selected mathematical optimization problems.

show abstract