Solving the multi-compartment capacitated location routing problem with pickup–delivery routes and stochastic demands

Huang, Shan-Huen

doi:10.1016/j.cie.2015.05.008

Cited by 28 publications

(11 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Implementation is done through the use of the (Mat lab R2010b0 software and the use of a computer with (the Intel Celeron (R) CPU 1000M @ 1.80 GHz, RAM (2.00) GB) and computer system (Windows7 32 -bit), The set of standard issues available and known to CVRP is supported [13]. The selected issues consist of five groups [A, B, E, F, P] that differ in terms of vehicle capacity, number of vehicles, number of contract, As the contract for the issues used ranges between (16) to (135) knots and the number of vehicles ranges from (2) to (14) vehicles and vary the capacities of vehicles, both according to the units of the assumed quantity in each subset.…”

Section: Implement Algorithms and Compare And Analyze Results Throughmentioning

confidence: 99%

“…5-The study of ( Shan Huen Huang ., 2015) . Study and propose a method to solve the vehicle routing problem and determine the specific location of the multi-chamber capacity with the receiving and delivery routing with random request, This study is a mixture between the problem of positioning and the vehicle routing problem as the methodology of the solution has been divided into several stages starting in the stage of allocation of the site and then determine the contract or customers and then identify the best tracks linking the sites warehouses and customers, The tabu search algorithm (TS) was used to find solutions that identify and improve the best tracks and after applying the method and testing it through the use of standard issues that proved the approach of its ability and its possibilities in finding reasonable and good solutions [14].…”

Section: Reference Review:-mentioning

confidence: 99%

See 1 more Smart Citation

Solve the Capacitance Vehicle Routing Problem ( Cvrp) Using the Tabu Search Algorithm (Ts) and the Particle Swarm Optimization With Practical Application.

Bakhit¹,

noori²

2018

IJAR

View full text Add to dashboard Cite

Capacitated vehicle routing problem (CVRP), tabu search (TS) ,particle swarm optimization(PSO).In this paper we examine the vehicle routing problem (VRP) which is classified as a problem (NP-HARD). This problem addresses the design of tracks for a group of vehicles that equip a number of customers deployed in different locations. The objective of this problem is to reduce the total cost of delivery, taking into account the limitations of the problem, and also to design the optimal distribution of the tracks within the specified vehicle capacity limits. The study includes the most important methods used to solve the problem, the use of the tabu search algorithm (TS) and particle swarm optimization(pso) and the hybridization of a new algorithm that adopts the characteristics of tabu search with particle swarm optimization ( TS-PSO) in solving problem Issues. The performance and efficiency of the algorithms are compared by solving known issues of the problem. The results show that the tabu search algorithm (TS) is efficient in finding solutions to the problem. The ability to reach the mean deviation about (1.764) from the standard solutions for the set of standard issues. However, the TS-PSO is able to produce results that overcame the results of the tabu search algorithm as well as the particle swarm algorithm, although the hybrid algorithm requires double and large computational times compared to the two individually designed algorithms. The method of the problem has been applied in the General Company for the manufacture of grain distribution process from one of the mills to a group of agents deployed geographically The method was able to reach to draw and design the best possible paths for vehicles available at the least distance cut and the lowest number of vehicles. …………………………………………………………………………………………………….... Introduction:-The field of transport and logistics services has become an important basis for the management and supply of goods and services in distribution systems and for a large number of real-world applications where institutions and commercial centers have begun to adopt procedures and systems that adopt planning in the management of logistics transport and Which will help in the effective changes in the reduction of the total costs. In fact, the transfer process represents a large proportion of the costs usually in addition to the cost of goods and services and the process of

show abstract

Section: Implement Algorithms and Compare And Analyze Results Throughmentioning

confidence: 99%

Section: Reference Review:-mentioning

confidence: 99%

Solve the Capacitance Vehicle Routing Problem ( Cvrp) Using the Tabu Search Algorithm (Ts) and the Particle Swarm Optimization With Practical Application.

Bakhit¹,

noori²

2018

IJAR

View full text Add to dashboard Cite

show abstract

“…Vidović et al [10] proposed a mixed-integer programming model and a heuristic approach with and without fleet size costs to observe their impact on the multiproduct, multiperiod IRP in fuel delivery. Huang [11] employed the tabu search to solve an advanced capacitated location-routing problem in a distribution network with multiple pickup and delivery routes. Wang et al [12] formulated an oil distribution model intra-area with distribution quantity and routing as decision variables to extend the multidepot half open vehicle-routing problem with TWS.…”

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

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

“…(5) specifies the volume of rubber at depot i to be no more than the maximum capacity at rubber depot i. Eq. (6) shows that the volume of rubber transported to each depot is equal to the cumulative volume of rubber at the depot. Eq.…”

Section: Objective Functionmentioning

confidence: 99%

“…Therefore, to have good management, purchasing depots are built to make the transportation distance shorter than distances from farmers' locations to the rubber market. This helps the rubber farmers or agriculturalists to have an opportunity to sell their products at good prices and also make the delivery costs decrease [4]- [6]. These are other ways to help the farmers according to policies of the central markets and the government as well [2].…”

Section: Introductionmentioning

confidence: 99%

Solving the Location Routing Problem of the Central Rubber Market by Tabu Search

Kaewploy¹,

Sindhuchao²

2017

j.ijast

View full text Add to dashboard Cite

The central rubber market of Songkhla province is the center of the collection and distribution of rubber production from sellers to purchasers. It is considered ineffective because sellers need to deliver whole raw rubber to the market, resulting in high transport costs, especially for those who came a great distance and had little quantity. This research applied the tabu search method to solve the location selection problem of the rubber purchasing depot and manage transport routes to the market. Results found that there were 16 purchasing depots. The central rubber market had unlimited purchasing capacity while the other purchasing depots limited the quantity of rubber to 10 tons. There were five transport routes and five trucks (four ten-wheeled trucks and one ten-wheeled truck with a trailer). The total delivery costs were 53,313.89 baht per day. The answers about efficiency from the Lingo 13 program with small, medium, and large problems and real problems were not significantly statistically different at a significance level of 0.05.

show abstract

Solving the multi-compartment capacitated location routing problem with pickup–delivery routes and stochastic demands

Cited by 28 publications

References 17 publications

Solve the Capacitance Vehicle Routing Problem ( Cvrp) Using the Tabu Search Algorithm (Ts) and the Particle Swarm Optimization With Practical Application.

Solve the Capacitance Vehicle Routing Problem ( Cvrp) Using the Tabu Search Algorithm (Ts) and the Particle Swarm Optimization With Practical Application.

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

Solving the Location Routing Problem of the Central Rubber Market by Tabu Search

Contact Info

Product

Resources

About