检索结果-内蒙古大学图书馆

Genetic and Evolutionary Computation Conference (GECCO)

作者： Kummer, Alberto F. N. Buriol, Luciana S. de Araujo, Olinto C. B. Univ Fed Rio Grande do Sul Porto Alegre RS Brazil Univ Fed Santa Maria Santa Maria RS Brazil

ISBN: (纸本)9781450371285

We applied a Biased Random Key Genetic Algorithm (BRKGA) to solve the vehicle routing problem with time windows and Synchronization Constraints. Additionally, both vehicles and clients are skilled, and each client can require up to two distinct skills to be serviced. On double-skilled clients, the operations of each skill should be performed by different vehicles, either simultaneously or respecting a precedence order. Those requirements introduce nonlinearities on the problem, in the sense that a small change on a single route potentially impacts all the other routes of the solution, making it hard to define an effective local search procedure. To circumvent this difficulty, we approached the problem using a genetic algorithm that evolves the sequence in which the services are inserted into the routes. We assessed the performance of our solution method using instances from the literature of the home health care problem. The genetic algorithm outperformed the previous best-known solutions found by a fix-and-optimize matheuristic by up to 25%, using less than half of computational times reported previously. The BRKGA demonstrated to be able to perform well both in exploration and exploitation in the solution space of the problem.

关键词： vehicle routing problem with time windows route synchronization constraints biased random key genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Co-operation of processes in parallel simulated annealing

Co-operation of processes in parallel simulated annealing

引用

18th IASTED International Conference on Parallel and Distributed Computing and Systems

作者： Czech, Zbigniew J. Silesia Univ Technol Gliwice Poland

ISBN: (纸本)9780889866386

The co-operation of parallel simulated annealing processes to solve the vehicle routing problem with time windows (VRPTW) is considered. The objective is to investigate how the number of parallel processes and the frequency of processes co-operation influence the accuracy of solutions to the VRPTW. The accuracy of solutions is measured by their proximity to the best known solution.

关键词： parallel simulated annealing bicriterion optimization vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Frequency of co-operation of parallel simulated annealing processes

引用

6th International Conference on Parallel Processing and Applied Mathematics

作者： Czech, Zbigniew J. Wieczorek, Bona Silesia Univ Technol Gliwice Poland Univ Silesia Sosnowiec Poland Katowice Sch Econ Katowice Poland

ISBN: (纸本)3540341412

A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is considered. The objective is to investigate how the frequency of co-operation of parallel simulated annealing processes influences the quality of solutions to the problem. The quality of a solution is measured by its proximity to the optimum solution.

关键词： parallel simulated annealing frequency of co-operation of parallel processes vehicle routing problem with time windows bicriterion optimization

来源：评论

学校读者我要写书评

暂无评论

Revised Pulse Algorithm for Elementary Shortest Path problem with Resource Constraints 7

Revised Pulse Algorithm for Elementary Shortest Path Problem...

引用

7th International Symposium on Computing and Networking (CANDAR)

作者： Li, Jiaxin Han, Xin Dalian Univ Technol Software Sch Dalian Peoples R China

ISBN: (纸本)9781728147253

In this article, we describe an algorithm to solve elementary shortest path problem (ESPPRC) that improves the method proposed in [Lozano et al., Transportation Science, 2015]. ESPPRC has been the backbone of solving vehicle routing problem (VRP) using the branch-and-price procedure, especially vehicle routing problem with time windows (VRPTW). The main idea of our contribution is splicing two partial paths to get a complete path in order to reduce the search space. We embed our algorithm into a column generation procedure to solve the linear relaxation of VRPTW. Experiment results show that the algorithm proposed in this paper can significantly reduce the search space and the running time. Our algorithm has a shorter average running time in 51 of the 56 instances. All experiment data sets are from Solomon benchmark [Solomon, Operations Research, 1987].

关键词： vehicle routing problem Elementary Shortest Path problem Column Generation vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

An Investigation on Compound Neighborhoods for VRPTW 5

An Investigation on Compound Neighborhoods for VRPTW

引用

5th International Conference on Operations Research and Enterprise Systems (ICORES)

作者： Chen, Binhui Qu, Rong Bai, Ruibin Ishibuchi, Hisao Univ Nottingham Nottingham England Univ Nottingham Ningbo Ningbo Zhejiang Peoples R China Osaka Prefecture Univ Osaka Japan

ISBN: (纸本)9783319539829;9783319539812

The vehicle routing problem with time windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time intervals and capacity constraints. A Variable Neighbourhood Search algorithm which can simultaneously optimize both objectives of VRPTW (to minimize the number of vehicles and the total travel distance) is proposed in this paper. The three compound neighbourhood operators are developed with regards to problem characteristics of VRPTW. Compound neighbourhoods combine a number of independent neighbourhood operators to explore a larger scale of neighbourhood search space. Performance of these operators has been investigated and is evaluated on benchmark problems.

关键词： Variable Neighbourhood Search vehicle routing problem with time windows Compound neighbourhood Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

A concept for simulation-based optimization in vehicle routing problems

A concept for simulation-based optimization in Vehicle Routi...

引用

16th IFAC Symposium on Information Control problems in Manufacturing (INCOM)

作者： Mazzuco, D. E. Carreirao Danielli, A. M. Oliveira, D. L. Santos, P. P. P. Pereira, M. M. Coelho, L. C. Frazzon, E. M. Univ Fed Santa Catarina Ind & Syst Engn Dept Campus UFSC Florianopolis SC Brazil Univ Laval Fac Adm Sci Canada Res Chair Integrated Logist Quebec City PQ Canada

Transport processes directly influence the operational performance of distributed production systems. In this context, the vehicle routing problem (VRP) aims for optimizing the delivery of goods, choosing the best route, which reduces travel time, distance or cost. This paper deals with a variant of the VRP, known as VRP with time windows (VRPTW) considering daily scheduling. Therefore, this paper proposes a simulation based optimization approach for transport scheduling and vehicle routing. The approach was validated in a test case focus on minimize the total cost of the distance travelled in a scenario composed by 13 vehicles and 100 clients. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： vehicle routing problem with time windows Complex Logistic Systems Optimization Simulation

来源：评论

学校读者我要写书评

暂无评论

Bid Formation in a Combinatorial Auction for Logistics Services

Bid Formation in a Combinatorial Auction for Logistics Servi...

引用

9th International Conference on Enterprise Information Systems (ICEIS 2007)

作者： Gujo, Oleg Schwind, Michael Goethe Univ Frankfurt Inst Informat Syst Mertonstr 17 D-60054 Frankfurt Germany Tech Univ Kaiserslautern Business Informat Syst & Operat Res D-67663 Kaiserslautern Germany

ISBN: (纸本)9783540887096

The exchange of cargo capacities is well established in the practice of logistics. However, there are few e-market places that consider the synergies that can be generated by finding the appropriate combination of lanes for different carriers. One way to do this is to employ combinatorial auctions that allow one to bid on bundles of lanes. This article describes the design, implementation, and analysis of a combinatorial intra-enterprise exchange for logistics services. The enterprise regarded here is organized in a profit center structure, while each center is able to release delivery contracts for outsourcing if the geographic location of a customer allows a reduced-cost delivery by another profit center in the neighborhood. Our combinatorial exchange ComEx uses the results of an integrated routing system DynaRoute for cost calculation in the ill and outsourcing process. We focus on the comparison of two clustering mechanisms used to form bids in the auction.

关键词： Combinatorial exchange logistic services vehicle routing problem with time windows profit center structure

来源：评论

学校读者我要写书评

暂无评论

Nature of Real-World Multi-objective vehicle routing with Evolutionary Algorithms

Nature of Real-World Multi-objective Vehicle Routing with Ev...

引用

IEEE International Conference on Systems, Man and Cybernetics (SMC)

作者： Castro-Gutierrez, Juan Landa-Silva, Dario Moreno Perez, Jose Univ Nottingham Sch Comp Sci ASAP Res Grp Nottingham NG7 2RD England Univ la Laguna Dpto Estadistica I O Computac San Cristobal de la Laguna Spain

ISBN: (纸本)9781457706530

The vehicle routing problem with time windows (VRPTW) is an important logistics problem which in the real-world appears to be multi-objective. Most research in this area has been carried out using classic datasets designed for the single-objective case, like the well-known Solomon's problem instances. Some unrealistic assumptions are usually made when using these datasets in the multi-objective case (e. g. assuming that one unit of travel time corresponds to one unit of travel distance). Additionally, there is no common VRPTW multi-objective oriented framework to compare the performance of algorithms because different implementations in the literature tackle different sets of objectives. In this work, we investigate the conflicting (or not) nature of various objectives in the VRPTW and show that some of the classic test instances are not suitable for conducting a proper multi-objective study. The insights of this study have led us to generate some problem instances using data from a real-world distribution company. Experiments in these new dataset using a standard evolutionary algorithm (NSGA-II) show stronger evidence of multi-objective features. Our contribution focuses on achieving a better understanding about the multi-objective nature of the VRPTW, in particular the conflicting relationships between 5 objectives: number of vehicles, total travel distance, makespan, total waiting time, and total delay time.

关键词： Multi-Objective Optimisation vehicle routing problem with time windows Combinatorial Optimisation Benchmark Datasets

来源：评论

学校读者我要写书评

暂无评论

The impact of the energy consumption function on Electric vehicle routing problems.

The impact of the energy consumption function on Electric Ve...

引用

作者： Anouk Kerssens Vrije Universiteit Amsterdam

学位级别：硕士

So far knowledge about the influence of the chosen function that estimates the energy consumption on the outcome of Electrical vehicle routing problems (EVRPs) is limited. This paper compares the outcome of three variants of the energy consumption estimation function. An existing mathematical model is used as the base model. The variants of the energy consumption function are implemented in this model. Different instances are tested to compare the problem variants. The instances variate in number of customers, number of vehicles and battery capacity. None of the tested instances resulted in feasible solutions for all three problem variants. This makes it impossible to compare the costs of the variants. However it can be concluded from the results that the energy consumption function does have an impact on the outcome of the instances. The influence of the estimation of the energy consumption in EVRPs should not be underestimated. The energy consumption function and its parameters should not be simply assumed, they should be based on the vehicle considered. Further research has to be performed to use slopes and terrain gradients that can variate on each arc. This would improve the energy consumption functions of two problem variants, because this better displays reality. This paper presents an optimized version of the mathematical model presented in the base article. The model presented can be used by the research field of EVRPs with time windows and energy prices that variate on time of use. Moreover, it can support decision makers in the field of (electric) transportation to make decisions. Supporting this sector may make it easier for them to start using Electric vehicles (EVs) or to expand their current fleet. This way pollution can be reduced.

关键词： Electric vehicles Energy consumption vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

An Improved Method for Scheduling Aircraft Ground Handling Operations From a Global Perspective

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2019年第4期36卷 1950020.1-1950020.25页

作者： Padron, Silvia Guimarans, Daniel TBS Business Sch Toulouse France Monash Univ Fac Informat Technol Data Sci & Artificial Intelligence Grp Melbourne Vic Australia

The turnaround is a critical airport process where a set of interrelated operations need to be performed to get an aircraft ready for its next flight. These activities are carried out by different vehicles, which need to be coordinated to guarantee an efficient utilization of resources. Due to the relations between operations, the order in which these resources are scheduled has a critical influence on the planning and performance of the turnaround. In this work, we present a novel methodology for solving the proposed bi-objective ground handling scheduling problem from a global perspective. This means solving a set of interconnected routing problems with restrictive time windows for each operation. We first explore the solution space using a fast heuristic, focusing then on the most promising solutions to intensify the search in the vicinity of the Pareto frontier. This two-step schema permits significantly reducing the required computational time, which, in turn, allows a more thorough exploration of solutions. Different experiments over real data from two Spanish airports have been conducted to assess the proposed methodology. Our results show that the new method not only outperforms previous approaches in terms of computational requirements, but can also improve the quality of scheduling solutions.

关键词： Air transportation multi-objective optimization problem Pareto solutions vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：