A column generation approach for an emission-oriented vehicle routing problem on a multigraph

Behnke, Martin; Kirschstein, Thomas; Bierwirth, Christian

doi:10.1016/j.ejor.2020.06.035

Cited by 37 publications

(11 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, due to the particularity of the vehicle routing problem, the sub-problem is also described as a mixed integer programming, so in each iteration of the algorithm, it takes too much time using commercial solvers such as CPLEX and GUROBI. Yuan et al [16] proposed a set partitioning model for the generalized vehicle routing problem, and proposed a heuristic algorithm based on column generation. This mathematical method relies on constructing heuristics, path optimization process, local search operators and heuristic process to provide negative cost reducing paths.…”

Section: Literature Reviewmentioning

confidence: 99%

Solving open vehicle problem with time window by hybrid column generation algorithm

Qian

et al. 2022

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

This paper addresses the open vehicle routing problem with time window (OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task. The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process. We propose a hybrid column generation algorithm (HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Solving open vehicle problem with time window by hybrid column generation algorithm

Qian

et al. 2022

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

show abstract

“…Various types of optimization algorithms and models are proposed and discussed, such as in the [ 14 ] whale optimization algorithm (WOA) algorithm combined with the tabu search algorithm and local search procedures; and in [ 21 ] grey wolf optimizer is prefered. In [ 4 ], the multipath (multiple possible arcs for traveling between two vertexes) map on an urban area of Berlin is considered with randomly generated demands (orders). Historical information about the traffic of the road (arc) is a parameter of the problems for a green VRP, and in [ 17 ], the time-dependent multidepot green vehicle routing problem with time windows (TDMDGVRPTW) is considered based on the historical traffic information of the network.…”

Section: Appendixmentioning

confidence: 99%

Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period

Altınöz

2022

Neural Comput & Applic

View full text Add to dashboard Cite

This research is based on the capacitated vehicle routing problem with urgency where each vertex corresponds to a medical facility with a urgency level and the traveling vehicle could be contaminated. This contamination is defined as the infectiousness rate, which is defined for each vertex and each vehicle. At each visited vertex, this rate for the vehicle will be increased. Therefore time-total distance it is desired to react to vertex as fast as possible- and infectiousness rate are main issues in the problem. This problem is solved with multiobjective optimization algorithms in this research. As a multiobjective problem, two objectives are defined for this model: the time and the infectiousness, and will be solved using multiobjective optimization algorithms which are nondominated sorting genetic algorithm (NSGAII), grid-based evolutionary algorithm GrEA, hypervolume estimation algorithm HypE, strength Pareto evolutionary algorithm shift-based density estimation SPEA2-SDE, and reference points-based evolutionary algorithm.

show abstract

“…Hiermann et al (2019) integrated vehicle selection in electric and plug-in hybrid VRPs. Recently, Behnke et al (2020) formulated an emission-oriented VRP on a multigraph and proposed a column generation algorithm to solve it.…”

Section: Vrps In Multigraph Settingmentioning

confidence: 99%

Multi-objective periodic cash transportation problem with path dissimilarity and arrival time variation

Tikani

Setak

Demir

2021

Expert Systems with Applications

View full text Add to dashboard Cite

This paper introduces a multi-objective periodic routing problem in the context of cash transportation, which attempts to increase security by generating unpredictable alternative paths and spreading arrival times at each demand node. The current study covers the shortcomings of previous models on dissimilar routing and cash transportation problems from several aspects. The studied problem has tri objectives, including completion times, risk of robbery, and customers' satisfaction level considering the effects of traffic congestion as a daily phenomenon. On top of these, we extend the studied routing problem in multigraph setting, which can keep a set of efficient paths with multiple attributes (e.g., risk, time). Such representation enables us to evoke dissimilar route plans not only by reordering the sequence of nodes but also by employing alternative links even in a fix sequence of nodes. To handle the computational challenges arising from these properties, we propose a new evolutionary algorithm based on NSGA-II. The proposed method is embedded with a fuzzy logic technique to guide the applied operators and benefits from caching memory to accelerate and diversify the searching process. The results of implementing the proposed algorithm on test instances confirm the effectiveness of our method in compression to standard NSGA-II. In addition, our performed sensitivity analyses show that the multigraph setting can substantially improve the quality of solutions with respect to all studied objectives.

show abstract

A column generation approach for an emission-oriented vehicle routing problem on a multigraph

Cited by 37 publications

References 45 publications

Solving open vehicle problem with time window by hybrid column generation algorithm

Solving open vehicle problem with time window by hybrid column generation algorithm

Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period

Multi-objective periodic cash transportation problem with path dissimilarity and arrival time variation

Contact Info

Product

Resources

About