scholarly journals Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi-Hua Hu ◽  
Yingxue Zhao ◽  
Tsan-Ming Choi
Keyword(s):  
Supply Chain ◽  
Supply Chains ◽  
Vehicle Routing ◽  
Simulation Analysis ◽  
Programming Model ◽  
Routing Problem ◽  
Cross Docking ◽  
Proposed Model ◽  
Time Distance ◽  
The Cross

Cross-docking, as a strategy to reduce lead time and enhance the efficiency of the fashion supply chain, has attracted substantial attention from both the academy and the industry. Cross-docking is a critical part of many fashion and textiles supply chains in practice because it can help to achieve many supply chain strategies such as postponement. We consider a model where there are multiple suppliers and customers in a single cross-docking center. With such a model setting, the issue concerning the coordinated routing between the inbound and outbound routes is much more complex than many traditional vehicle routing problems (VRPs). We formulate the optimal route selection problems from the suppliers to the cross-docking center and from the cross-docking center to the customers as the respective VRPs. Based on the relationships between the suppliers and the customers, we integrate the two VRP models to optimize the overall traveling time, distance, and waiting time at the cross-docking center. In addition, we propose a novel mixed 0/1 integer linear programming model by which the complexity of the problem can be reduced significantly. As demonstrated by the simulation analysis, our proposed model can be solved very efficiently by a commonly used optimization software package.

A Multi-Period Evacuation Vehicle Routing Problem Model

2014 ◽  
Vol 931-932 ◽  
pp. 578-582
Author(s):  
Sunarin Chanta ◽  
Ornurai Sangsawang
Keyword(s):  
Vehicle Routing ◽  
Public Transportation ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
High Water ◽  
Mixed Integer ◽  
Routing Problem ◽  
Problem Model ◽  
Proposed Model ◽  
Evacuation Routing

In this paper, we proposed an optimization model that addresses the evacuation routing problem for flood disaster when evacuees trying to move from affected areas to safe places using public transportation. A focus is on the situation of evacuating during high water level when special high vehicles are needed. The objective is to minimize the total traveled distance through evacuation periods where a limited number of vehicles is given. We formulated the problem as a mixed integer programming model based on the capacitated vehicle routing problem with multiple evcuation periods where demand changing by the time. The proposed model has been tested on a real-world case study affected by the severe flooding in Thailand, 2011.

A new transshipment policy in cluster supply chains based on system dynamics

2018 ◽  
Vol 52 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Bo Yan ◽  
Lifeng Liu
Keyword(s):  
Supply Chain ◽  
System Dynamics ◽  
Supply Chains ◽  
Industrial Cluster ◽  
Inventory Level ◽  
Network System ◽  
Supply Chain Network ◽  
Proposed Model ◽  
Total Inventory ◽  
The Cross

In this paper, the cross-chain inventory emergency supplementary of two single supply chains is investigated to simulate the transshipment of the supply chain network system in the industrial cluster supply chains. We assume that each single supply chain is composed by a manufacturer, a wholesaler and a retailer. Besides, a new transshipment policy based on system dynamics (SD) is proposed in this paper, called the model of the cross-chain inventory transshipment between two enterprises from both the same tier and different tiers. The new proposed model is different from the model of the cross-chain inventory transshipment between two enterprises at the same tier and the model of the cross-chain inventory transshipment between two enterprises at different tiers, which have been researched by previous scholars. Some comparisons are made among the three models. It is proved that the new proposed model can improve the customer satisfaction level (CSL) and lower the total inventory level than the two other models existing currently.

scholarly journals Vehicle Routing and Scheduling Problem for a multi-period, multi-perishable product system with time window: A Case study

2017 ◽  
Vol 5 (2) ◽  
pp. 45 ◽  
Author(s):  
Alireza Rashidi Komijan ◽  
Danial Delavari
Keyword(s):  
Vehicle Routing ◽  
Time Window ◽  
Programming Model ◽  
Transportation Costs ◽  
Mixed Integer ◽  
Pickup And Delivery ◽  
Routing Problem ◽  
Routing And Scheduling ◽  
Perishable Product ◽  
Proposed Model

<div data-canvas-width="542.172"><p>The well-known Vehicle Routing Problem (VRP) is to find proper sequence of routes in order to minimize transportation costs. In this paper, a mixed-integer programming model is presented for a food distributer company and the model outputs are to determine the optimal routes and amount of pickup and delivery. In the objective function, the costs of transportation, holding, tardiness and earliness are considered simultaneously. The proposed model with respect to real conditions is multi-period and has two different time periods: one for dispatching vehicles to customers and suppliers and the other for receiving  customers’ orders. Time window and split pickup and delivery are considered for perishable products. The proposed model is  nonlinear and will be linearized using exact techniques. At the end, model is solved using GAMS and the sensitivity analysis  is performed. The results indicate that the trend of changes in holding and transportation costs in compared to tardiness and  earliness costs are closed together and are not so sensitive to demand changes.</p></div>

scholarly journals Heuristic algorithms applied to the problems of servicing actors in supply chains

2017 ◽  
Vol 44 (4) ◽  
pp. 25-34 ◽  
Author(s):  
Mariusz Izdebski ◽  
Ilona Jacyna-Gołda ◽  
Katarzyna Markowska ◽  
Jakub Murawski
Keyword(s):  
Supply Chain ◽  
Supply Chains ◽  
Vehicle Routing ◽  
Heuristic Algorithms ◽  
Time Windows ◽  
Production Capacity ◽  
Task Assignment ◽  
Cost Of Transport ◽  
Routing Problem ◽  
Complex Decision

The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.

An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments

2021 ◽  
pp. 105513
Author(s):  
Asefeh Hasani Goodarzi ◽  
Eleen Diabat ◽  
Armin Jabbarzadeh ◽  
Marc Paquet
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Cross Docking ◽  
Queue Model

A robust possibilistic programming model for production-routing problem in a three-echelon supply chain

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mohammad Ali Beheshtinia ◽  
Narjes Salmabadi ◽  
Somaye Rahimi
Keyword(s):  
Supply Chain ◽  
Real Life ◽  
Model Parameters ◽  
Pickup And Delivery ◽  
Distribution Centers ◽  
Routing Problem ◽  
Remarkable Feature ◽  
Content Type ◽  
Proposed Model ◽  
Production Routing

Purpose This paper aims to provide an integrated production-routing model in a three-echelon supply chain containing a two-layer transportation system to minimize the total costs of production, transportation, inventory holding and expired drugs treatment. In the proposed problem, some specifications such as multisite manufacturing, simultaneous pickup and delivery and uncertainty in parameters are considered. Design/methodology/approach At first, a mathematical model has been proposed for the problem. Then, one possibilistic model and one robust possibilistic model equivalent to the initial model are provided regarding the uncertain nature of the model parameters and the inaccessibility of their probability function. Finally, the performance of the proposed model is evaluated using the real data collected from a pharmaceutical production center in Iran. The results reveal the proper performance of the proposed models. Findings The results obtained from applying the proposed model to a real-life production center indicated that the number of expired drugs has decreased because of using this model, also the costs of the system were reduced owing to integrating simultaneous drug pickup and delivery operations. Moreover, regarding the results of simulations, the robust possibilistic model had the best performance among the proposed models. Originality/value This research considers a two-layer vehicle routing in a production-routing problem with inventory planning. Moreover, multisite manufacturing, simultaneous pickup of the expired drugs and delivery of the drugs to the distribution centers are considered. Providing a robust possibilistic model for tackling the uncertainty in demand, costs, production capacity and drug expiration costs is considered as another remarkable feature of the proposed model.

scholarly journals A Synchronous Optimization Model for Multiship Shuttle Tanker Fleet Design and Scheduling Considering Hard Time Window Constraint

2018 ◽  
Vol 2018 ◽  
pp. 1-8
Author(s):  
Zhenfeng Jiang ◽  
Dongxu Chen ◽  
Zhongzhen Yang
Keyword(s):  
Time Window ◽  
Programming Model ◽  
Transportation Cost ◽  
Exact Algorithm ◽  
Mixed Integer ◽  
Routing Problem ◽  
Hard Time ◽  
Proposed Model ◽  
Total Transportation Cost ◽  
Time Window Constraints

A Synchronous Optimization for Multiship Shuttle Tanker Fleet Design and Scheduling is solved in the context of development of floating production storage and offloading device (FPSO). In this paper, the shuttle tanker fleet scheduling problem is considered as a vehicle routing problem with hard time window constraints. A mixed integer programming model aiming at minimizing total transportation cost is proposed to model this problem. To solve this model, we propose an exact algorithm based on the column generation and perform numerical experiments. The experiment results show that the proposed model and algorithm can effectively solve the problem.

Sign in / Sign up

Export Citation Format

Share Document