scholarly journals Transshipment Vehicle Routing with Pickup and Delivery for Cross-Filling

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Suk-Chul Rim ◽  
Hang T. T. Vu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Pickup And Delivery ◽  
Distribution Centers ◽  
Inventory Cost ◽  
Fill Rate ◽  
Total Cost ◽  
Economic Justification ◽  
Handling Cost ◽  
High Level

Distribution centers (DCs) typically receive orders from the customers (mostly retail stores) located in their vicinity and deliver the ordered goods the next day morning. To maintain high item fill rate, DCs have to hold a high level of inventory, which will increase inventory cost. As an alternative, cross-filling is that, after closing the daily order receipt, DCs exchange surplus items during the night to reduce the shortage. The economic justification of such cross-filling will depend on the tradeoff between extra transshipment and handling cost versus saved shortage cost. In this paper, as an extension of Rim and Jiang, 2019, vehicles are allowed to drop and pick up items at the intermediate DCs in the route. We present a genetic algorithm to determine the routes and amount to pick up/drop at each DC to minimize the total cost.

scholarly journals Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Peiqing Li ◽  
Jie He ◽  
Dunyong Zheng ◽  
Yongsheng Huang ◽  
Chenhao Fan
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Fruits And Vegetables ◽  
Time Windows ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Total Cost ◽  
Soft Time Windows ◽  
Distribution Process

Fresh fruits and vegetables, perishable by nature, are subject to additional deterioration and bruising in the distribution process due to vibration and shock caused by road irregularities. A nonlinear mathematical model was developed that considered not only the vehicle routing problem with time windows but also the effect of road irregularities on the bruising of fresh fruits and vegetables. The main objective of this work was to obtain the optimal distribution routes for fresh fruits and vegetables considering different road classes with the least amount of logistics costs. An improved genetic algorithm was used to solve the problem. A fruit delivery route among the 13 cities in Jiangsu Province was used as a real analysis case. The simulation results showed that the vehicle routing problem with time windows, considering road irregularities and different classes of toll roads, can significantly influence total delivery costs compared with traditional VRP models. The comparison between four models to predict the total cost and actual total cost in distribution showed that the improved genetic algorithm is superior to the Group-based pattern, CW pattern, and O-X type cross pattern.

An Improved Genetic Algorithm for Multi-Depot Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery Time Windows

2015 ◽  
Vol 738-739 ◽  
pp. 361-365 ◽  
Author(s):  
Yan Guang Cai ◽  
Ya Lian Tang ◽  
Qi Jiang Yang
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Pickup And Delivery ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Heterogeneous Vehicle Routing Problem ◽  
Simultaneous Pickup And Delivery ◽  
Elite Selection

Multi-depot heterogeneous vehicle routing problem with simultaneous pickup and delivery and time windows (MDHVRPSPDTW) is an extension of vehicle routing problem (VRP), MDHVRPSPDTW mathematical model was established. The improved genetic algorithm (IGA) is proposed for solving the model. Firstly, MDHVRPSPDTW is transferred into different groups by the seed customer selecting method and scanning algorithm (SA).Secondly, IGA based on elite selection and inversion operator is used to solve the model, and then cutting merge strategy based on greedy thought and three kinds of neighborhood search methods is applied to optimize the feasible solutions further. Finally, 3-opt local search is applied to adjust the solution. The proposed IGA has been test on a random new numerical example.The computational results show that IGA is superior to branch and bound algorithm (BBD) by Lingo 9.0 in terms of optimum speed and solution quality, and the model and the proposed approach is effective and feasible.

Design and Implementation of a Multi-Channel HDLC Protocol Controller Based on FPGA

2011 ◽  
Vol 383-390 ◽  
pp. 6840-6845 ◽  
Author(s):  
Yong Hong Gu ◽  
Wei Huang ◽  
Qiao Li Yang
Keyword(s):  
Error Control ◽  
Data Transfer ◽  
Full Duplex ◽  
Programmable Logic ◽  
Data Link ◽  
Total Cost ◽  
Half Duplex ◽  
Level Data ◽  
Layer 2 ◽  
High Level

To transmit and receive data over any network successfully, a protocol is required to manage the flow. High-level Data Link Control (HDLC) protocol is defined in Layer 2 of OSI model and is one of the most commonly used Layer 2 protocol. HDLC supports both full-duplex and half-duplex data transfer. In addition, it offers error control and flow control. Currently on the market there are many dedicated HDLC chips, but these chips are neither of control complexity nor of limited number of channels. This paper presents a new method for implementing a multi-channel HDLC protocol controller using Altera FPGA and VHDL as the target technology. Implementing a multi-channel HDLC protocol controller in FPGA offers the flexibility, upgradability and customization benefits of programmable logic and also reduces the total cost of every project which involves HDLC protocol controllers.

Sign in / Sign up

Export Citation Format

Share Document