检索结果-南通市图书馆

An evolutionary algorithm approach for the constrained multi-depot vehicle routing problem

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Intelligent Computing and Cybernetics 2016年第1期9卷 2-22页

作者： Carin Lightner-Laws Vikas Agrawal Constance Lightner Neal Wagner Clayton State University MorrowGeorgiaUSA Jacksonville University JacksonvilleFloridaUSA Fayetteville State University FayettevilleNorth CarolinaUSA MIT Lincoln Laboratory LexingtonMassachusettsUSA

Purpose-The purpose of this paper is to explore a real world vehicle routing problem(VRP)that has multi-depot subcontractors with a heterogeneous fleet of vehicles that are available to pickup/deliver jobs with varying time windows and *** the overall job completion time and number of drivers utilized are analyzed for the automated job allocations and manual job assignments from transportation field ***/methodology/approach-A nested genetic algorithm(GA)is used to automate the job allocation process and minimize the overall time to deliver all jobs,while utilizing the fewest number of drivers-as a secondary ***-Three different real world data sets were used to compare the results of the GA vs transportation field experts’manual *** job assignments from the GA improved the overall job completion time in 100 percent(30/30)of the cases and maintained the same or fewer drivers as BS Logistics(BSL)in 47 percent(14/30)of the ***/value-This paperprovidesa novel approach to solving a real world VRPthathasmultiple *** there have been numerous models to capture a select number of these variants,the value of this nested GA lies in its ability to incorporate multiple depots,a heterogeneous fleet of vehicles as well as varying pickup times,pickup locations,delivery times and delivery locations for each job into a single *** research does not provide models to collectively address all of these variants.

关键词： Genetic algorithms Evolutionary computation vehicle routing Multiple depot transportation Hard/soft time windows

Enhanced solution representations for vehicle routing problems with split deliveries

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

工程管理前沿:英文版 2023年第3期10卷 483-498页

作者： Wenbin ZHU Zhuoran AO Roberto BALDACCI Hu QIN Zizhen ZHANG School of Business Administration South China University of TechnologyGuangzhou 510640China Thrust of Intelligent Transportation The Hong Kong University of Science and Technology(Guangzhou)Guangzhou 511466China College of Science and Engineering(CSE) Hamad Bin Khalifa University(HBKU)Doha 5825Qatar School of Management Huazhong University of Science and TechnologyWuhan 430074China School of Data and Computer Science Sun Yat-sen UniversityGuangzhou 510275China

In this study,we investigate a forest-based solution representation for split delivery vehicle routing problems(SDVRPs),which have several practical applications and are among the most difficult vehicle routing *** new solution representation fully reflects the nature of split delivery,and can help reduce the search space when used in heuristic *** on the forest structure,we devise three neighborhood search *** highlight the effectiveness of this solution representation,we integrate these operators into a standard tabu search *** conduct extensive experiments on three main SDVRPs addressed in the literature:The basic SDVRP,the multidepot SDVRP,and the SDVRP with time *** experimental results show that the new forest-based solution representation is particularly effective in designing and implementing neighborhood operators,and that our new approach outperforms state-of-the-art algorithms on standard datasets.

关键词： vehicle routing multidepot time windows tabu search split delivery

vehicle flow formulation for two-echelon time-constrained vehicle routing problem

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of Management Science and Engineering 2019年第2期4卷 75-90页

作者： Hongqi Li Ming Bai Yibin Zhao Changzhi Dai School of Transportation Science and Engineering Beihang UniversityBeijing100191China

Two-echelon routing problems,including variants such as the two-echelon vehicle routing problem(2E-VRP)and the two-echelon location routing problem(2E-LRP),involve assignment and location ***,the two-echelon time-constrained vehicle routing problem(2E-TVRP)that caters to from-linehaul-to-delivery practices does not involve assignment *** routing problem variant for networks with two eche-lons has not yet attracted enough research *** or long-distance services suffer from the lack of the assignment decisions between satellites and ***,the 2E-TVRP,rather than using assignment decisions,adopts time constraints to decide the routes on each of the two interacting echelons:large-capacity vehicles trans-port cargoes among satellites on the first echelon,and small-capacity vehicles deliver cargoes from satellites to customers on the second *** study introduces a mixed integer linear programming model for the 2E-TVRP and proposes a heuristic algorithm that incorporates the savings algorithm followed by a variable neighborhood search *** examples are used to test the mathematical formulation and the heuristic and a case study is used to demonstrate that the heuristic can effectively solve realistic-size instances of the 2E-TVRP.

关键词： vehicle routing Two-echelon Time constraints Mixed integer linear programming Variable neighborhood search

Set Divisions and Customer Point Collaborations-Based Heuristic vehicle routing with Appointment Time Window

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Set Divisions and Customer Point Collaborations-Based Heuris...

第26届中国控制与决策会议

作者： XU Zhengzheng TANG Jiafu School of Business Administration Northeastern University State Key Laboratory of Integrated Automation for Process Industries Northeastern University

ISBN: (纸本)9781479937066

This paper studies the collaboration-based vehicle routing problem with appointment time window aiming at the pickup and delivery service to airport. After defining the satisfaction degree under appointment time window, a heuristic approach is proposed to find the globally optimal vehicle routing scheme. By modeling the pickup and delivery service to airport with and without collaborations, the corresponding multi-constraint models are built. Set divisions and vehicle collaborations at customer points are considered to find the optimal basic and collaborative routes. Thus the optimal vehicle routing scheme with appointment time window can be created. Simulation results show that the proposed approach is feasible.

关键词： vehicle routing appointment time window pickup and delivery service average satisfaction degree vehicle collaborations

REFINEMENTS OF THE COLUMN GENERATION PROCESS FOR THE vehicle routing PROBLEM WITH TIME WINDOWS

在线全文

cnki会议

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 2004年第3期13卷 326-341页

作者： Jesper LARSEN Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs.LyngbyDenmark

The vehicle routing Problem with Time Windows is a generalization of the well knowncapacity constrained vehicle routing Problem.A homogeneous fleet of vehicles has to service a setof *** service of the customers can only start within a weU-defined time intervaldenoted the time *** objective is to determine routes for the vehicles that minimizes theaccumulated cost(or distance).Currently the best approaches for determining optimal solutions arebased on column generation and Branch-and-Bound,also known as *** paperpresents two ideas for ran-time improvements of the Branch-and-Price framework for the vehiclerouting Problem with Time *** ideas reveal a significant potential for run-timerefinements when speeding up an exact approach without compromising optimality.

关键词： vehicle routing time windows column generation shortest path branch-and-bound

Coupling of crop assignment and vehicle routing for harvest planning in agriculture

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Artificial Intelligence in Agriculture 2019年第2期2卷 99-109页

作者： Mogens Graf Plessen MGP is an independent researcher.

A method for harvest planning based on the coupling of crop assignment with vehicle routing is *** a setting with multiple fields,a path network connecting these,multiple depots at which a number of harvesters are initially located,the main question addressed is:Which crop out of a set of different crops to assign to each field when accounting for the given setting?It must be answered by every farm manager at the beginning of every work-cycle starting with plant seeding and ending with *** than solving an assignment problem only,it is here also accounted for the connectivity between *** practice,fields are often located distant *** costs of machinery and limited harvesting windows demand optimized operation and route ***,the proposed method outputs crop assignments to fields and simultaneously determines crop-tours,i.e.,optimized sequences in which to service fields of the same crop during *** is of particular relevance for larger farms and groups of farms that collaborate and share *** programming based exact algorithms are *** large numbers of fields,where these algorithms may not be tractable due to computational constraints,elements of clustering and the solution of local Traveling Salesman Problems are added,thereby on the one hand rendering the method heuristic and in general suboptimal,but on the other hand maintaining large-scale applicability.

关键词： Agricultural logistics Assignment problem vehicle routing Integer programming Decision support system

The Stochastic and Dynamic vehicle routing Problem: A Literature Review

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Stochastic and Dynamic Vehicle Routing Problem: A Litera...

2021中国智能自动化大会(CIAC2021)

作者： Jun Ma Jihui Zhang Yiyun Guo Institute of Complexity Science Qingdao University Shandong Key Laboratory of Industrial Control Technology Qingdao Port Int.Co.Ltd.

Because of its inherent difficulties and wide actual application requirements, uncertain vehicle routing problem has attracted extensive attention recently. Unfortunately, few literature have conducted a comprehensive review on this problem. We give a review mainly from the perspective of stochastic and dynamic, and further classify them into several small categories according to the solution methods and application scenarios respectively. In this survey, we ignore the complex mathematic models and algorithms, aiming to give an intuitive understanding on structure, common methods and strategies for beginner in this field.

关键词： Uncertainty Stochastic and dynamic vehicle routing Literature review

An Evolutionary Ant Colony Algorithm for a vehicle routing Problem with Simultaneous Pick-up and Delivery and Hard Time Windows

在线全文

cnki会议

学校读者我要写书评

暂无评论

An Evolutionary Ant Colony Algorithm for a Vehicle Routing P...

第30届中国控制与决策会议

作者： Xingcheng Pu Keli Wang School of Computer Science Chongqing University of Posts and Telecommunications

In order to minimize the travel distance, an evolutionary ant colony algorithm(EAC) has been developed to solve the vehicle routing problem with simultaneous pick-up and delivery and hard time windows(VRPSPDHTW). In this algorithm, a candidate set is used to reduce the amount of computation while improving the quality of the solution. Time window factor and demand factor are added to the state transition rules in order to find the most suitable customer. By using a shuffled complex evolution algorithm, ant colony is optimized selectively. Experiment shows that this strategy not only reduces the amount of computation, but also avoids falling into local optima. A new method for updating pheromones is presented, and the local search methods are used to further optimize the solutions. Numerical examples show that the presented algorithm is effective for handling VRPSPDHTW.

关键词： Ant Colony Shuffled Complex Evolutionary vehicle routing Simultaneous Pick-up and Delivery Time Windows

A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery

在线全文

cnki会议

学校读者我要写书评

暂无评论

A hybrid genetic algorithm for the vehicle routing problem w...

2009中国控制与决策会议

作者： Fanggeng Zhao~1,Dong Mei~1,Jiangsheng Sun~2,Weimin Liu~3 1.vehicle Management Institute,Bengbu 233011,China 2.Ordnance Technoloev Research Institute,Shiiiazhuang 050003,China 3.School of Mechanical Engineering,Hebei Polytechnic University,Tangshan 063009,China

The vehicle routing problem with simultaneous pickup and delivery is an important variation of VRP where customers require simultaneous pickup and delivery *** this paper,we proposed a hybrid genetic algorithm to solve this *** the proposed algorithm,we proposed a pheromone-based crossover operator that utilizes both the local and global information to construct *** local information used in crossover operator includes edge lengths and adjacency relations,while the global information is stored as pheromone *** improve the performance of genetic algorithm,a local search procedure is integrated into GA,and acts as the mutation *** hybrid algorithm was tested on benchmark instances,and experimental results are conclusively in favor of our algorithm.

关键词： Genetic algorithm Pheromone-based crossover vehicle routing Pickup and delivery