Vehicle selection for a multi-compartment vehicle routing problem

Ostermeier, Manuel; Hübner, Alexander

doi:10.1016/j.ejor.2018.01.059

Cited by 46 publications

(17 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…New chromosomes are generated until requirements are fulfilled. Formula (19) shows the calculation for the fitness function value F k . TC k indicates the objective function of the kth chromosome, δ k represents the unqualified chromosome number, and M denotes the penalty weight for each unqualified chromosome (particle).…”

Section: Solution Methodologymentioning

confidence: 99%

“…ey proposed formulations and models for certain MCDP cases and versions and then described a branch-and-cut algorithm that is applicable to all variants. Ostermeier and Hübner [19] identified vehicledependent costs within empirical data collection and used a large neighborhood search to solve an extended multicompartment vehicle-routing problem (MCVRP) for grocery distribution. Vahdani et al [20] developed a biobjective optimization model and used two metaheuristic multiobjective algorithms to integrate the assignment of quay cranes in container terminals and internal TS assignment.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment

Wang

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

Energy supply is an important system that affects the overall efficiency of urban transportation. To improve the system operational efficiency and reduce costs, we formulate and solve a collaborative multidepot petrol station replenishment problem with multicompartments and time window assignment by establishing a mixed-integer linear programming model. The hybrid heuristic algorithm composed of genetic algorithm and particle swarm optimization is used as a solution, and then the Shapley value method is applied to analyze the profit allocation of each petrol depot under different coalitions. The optimal membership sequence of the cooperation is determined according to the strict monotone path. To analyze and verify the effectiveness of the proposed method, a regional petrol supply network in Chongqing city in China is investigated. Through cooperation between petrol depots in the supply network, the utilization of customer clustering, time window coordination, and distribution truck sharing can significantly reduce the total operation costs and improve the efficiency of urban transportation energy supply. This approach can provide theoretical support for relevant government departments and enterprises to make optimal decisions. The implementation of the joint distribution of energy can promote the sustainable development of urban transportation.

show abstract

Section: Solution Methodologymentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment

Wang

et al. 2020

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…Equation (4) ensures that products moved to the warehouses are equal to the number produced at various factories. Equation (5) ensures that the initial amount of product at the internal warehouse is products produced and stored at t 0 . Equation 6updates of the number of products at the warehouses.…”

Section: Optimization Modelmentioning

confidence: 99%

“…Public-transports (transits) involve lots of stopovers with constant changes in the load (passengers). According to [5], a mixed fleet with multi-compartment and single-compartment vehicle is better than a single fleet vehicle, especially in grocery distribution. The distribution of groceries also involves stopovers with decrease in load as groceries are offloaded to consumers.…”

Section: Introductionmentioning

confidence: 99%

A Multi-Vehicle, Multi-Factory Assignment Problem: A Case of Coca-Cola Bottling Company at Ahinsan and Spintex-Ghana

Appiah¹,

Otoo²,

Adjei³

2020

AJOR

View full text Add to dashboard Cite

Determining the type of vehicles to transport goods between multiple factories and numerous distributors with different demands is one of the major logistic decisions that have to be made by industry players to reduce the cost of operations. A Mixed-Integer Quadratic Programming (MIQP) model was used to optimally distribute goods to 105 distributors from two factories across Ghana. The formulated model and analysis show that the existence of multiple vehicles in a fleet purposely for long hauling of goods also renders an optimal minimum cost as compared to a single-vehicle fleet. This optimum minimum cost accounts for 0.2066 of the total cost incurred by the two factories. This resulted in a 25% reduction in transportation cost. Again, a single-vehicle fleet with loading capacity within the mean value of all individual demands gave a minimum cost next to the optimal minimum.

show abstract

“…Moreover, the cost will be greatly increased if all incompatible products are separately distributed by vehicles with single compartment [5]. Therefore, considering the transport efficiency and cost, the capacity of a vehicle can be split into several compartments to serve different types of products simultaneously and the multi-compartment vehicle routing problem (MCVRP) is coined [6].…”

Section: Introductionmentioning

confidence: 99%

An improved estimation of distribution algorithm for multi-compartment electric vehicle routing problem

Shen

Liwen

2021

J. of Syst. Eng. Electron.

View full text Add to dashboard Cite

The multi-compartment electric vehicle routing problem (EVRP) with soft time window and multiple charging types (MCEVRP-STW&MCT) is studied, in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process, are employed. A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost, distribution cost, time window penalty cost and charging service cost. To solve the problem, an estimation of the distribution algorithm based on Lévy flight (EDA-LF) is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum. Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm. In addition, when comparing with existing algorithms, the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances. Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.

show abstract

Vehicle selection for a multi-compartment vehicle routing problem

Cited by 46 publications

References 33 publications

Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment

Collaborative Multidepot Petrol Station Replenishment Problem with Multicompartments and Time Window Assignment

A Multi-Vehicle, Multi-Factory Assignment Problem: A Case of Coca-Cola Bottling Company at Ahinsan and Spintex-Ghana

An improved estimation of distribution algorithm for multi-compartment electric vehicle routing problem

Contact Info

Product

Resources

About