A branch-and-price algorithm for a vehicle routing with demand allocation problem

Reihaneh, Mohammad; Ghoniem, Ahmed

doi:10.1016/j.ejor.2018.06.049

Cited by 31 publications

(12 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First of all, distance matrices of individual graph vertices will be compiled. As for the calculations, Formula 1 (see below) based on the graph theory -location-allocation problem will be used [26]:…”

Section: Methodsmentioning

confidence: 99%

Modeling transportation routes of the pick-up system using location problem: a case study

et al. 2020

View full text Add to dashboard Cite

In today’s increasingly globalizing world, the demand for the transport of more and more specific kinds of goods is constantly growing. Greater diversity of the objects of transport extends the range of consignees and consignors, which implies the reduction of the number and volume of consignments. Modern enterprises are no longer interested in mass supplies of large quantities of the same material but strive for flexible supplies of smaller quantities of specific materials out of more suppliers. This manuscript deals with the streamlining of specific transport-logistics processes, including a detailed analysis of the existing pick-up system in relation to transport serviceability of the certain territory starting in the city of České Budějovice (Czech Republic) and a determination of more effective variants for supply. The primary objective will be to find and analyze specific options for streamlining the processes being optimized using the selected method of the graph theory, namely the location problem. In the context of optimization, a specific case study is elaborated with the aim to increase the efficiency of the current pickup system, i.e. serviceability of a particular territory.

show abstract

Section: Methodsmentioning

confidence: 99%

Modeling transportation routes of the pick-up system using location problem: a case study

et al. 2020

View full text Add to dashboard Cite

show abstract

“…Solak et al [ 10 ] presented a Benders decomposition approach for the VRDAP, which was compared with CPLEX. Reihaneh and Ghoniem [ 11 ] proposed a branch-and-price algorithm for solving the VRDAP, and they tested the approach on 60 randomly generated instances with up to 25 delivery sites and 50 customers.…”

Section: Literature Reviewmentioning

confidence: 99%

A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak

et al. 2021

View full text Add to dashboard Cite

“…The extension of this assignment problem is often called the transportation problem, which not only assigns the task to the machine, but also forms the transportation sequence when there is more than one task assigned to one machine: this is called the vehicle routing problem (VRP). There are plenty of examples of the transportation problem in the literature, such as transportation mode selection (road, waterway, railway) [10,11], connecting the transport mode by assigning the inbound and outbound gates of the product [12][13][14][15], transportation planning with time windows [14,[15][16][17], and optimal location assignment [18][19][20][21]. However, the AP aims to increase efficiency and sustainability by reducing time, cost, fuel consumption, and carbon dioxide emissions, increasing customer satisfaction levels and profits, and making other improvements.…”

Section: Literature Reviewmentioning

confidence: 99%

Modified Differential Evolution Algorithm for a Transportation Software Application

Supattananon

Akararungruangkul

2019

Journal of Open Innovation: Technology, Market, and Complexity

View full text Add to dashboard Cite

This research developed a solution approach that is a combination of a web application and the modified differential evolution (MDE) algorithm, aimed at solving a real-time transportation problem. A case study involving an inbound transportation problem in a company that has to plan the direct shipping of a finished product to be collected at the depot where the vehicles are located is presented. In the newly designed transportation plan, a vehicle will go to pick up the raw material required by a certain production plant from the supplier to deliver to the production plant in a manner that aims to reduce the transportation costs for the whole system. The reoptimized routing is executed when new information is found. The information that is updated is obtained from the web application and the reoptimization process is executed using the MDE algorithm developed to provide the solution to the problem. Generally, the original DE comprises of four steps: (1) randomly building the initial set of the solution, (2) executing the mutation process, (3) executing the recombination process, and (4) executing the selection process. Originally, for the selection process in DE, the algorithm accepted only the better solution, but in this paper, four new selection formulas are presented that can accept a solution that is worse than the current best solution. The formula is used to increase the possibility of escaping from the local optimal solution. The computational results show that the MDE outperformed the original DE in all tested instances. The benefit of using real-time decision-making is that it can increase the company’s profit by 5.90% to 6.42%.

show abstract

A branch-and-price algorithm for a vehicle routing with demand allocation problem

Cited by 31 publications

References 36 publications

Modeling transportation routes of the pick-up system using location problem: a case study

Modeling transportation routes of the pick-up system using location problem: a case study

A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak

Modified Differential Evolution Algorithm for a Transportation Software Application

Contact Info

Product

Resources

About