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

Exchange strategies for multiple Ant Colony System

INFORMATION SCIENCES 2007年第5期177卷 1248-1264页

作者： Ellabib, Issmail Calamai, Paul Basir, Otman Univ Waterloo Dept Syst Design Engn Waterloo ON N2L 3G1 Canada Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

In this paper we apply the concept of parallel processing to enhance the performance of the Ant Colony System algorithm. New exchange strategies based on a weighting scheme are introduced under three different types of interactions. A search assessment technique based on a team consensus methodology is developed to study the influence of these strategies on the search behavior. This technique demonstrates the influence of these strategies in terms of search diversity. The performance of the Multiple Ant Colony System algorithm, applied to the vehicle routing problem with time windows as well as the Traveling Salesman problem, is investigated and evaluated with respect to solution quality and computational effort. The experimental studies demonstrate that the Multiple Ant Colony System outperforms the sequential Ant Colony System. The studies also indicate that the weighting scheme improves performance, particularly in strategies that share pheromone information among all colonies. A considerable improvement is also obtained by combining the Multiple Ant Colony System with a local search procedure. (c) 2006 Elsevier Inc. All rights reserved.

关键词： parallel and distributed Ant Colony optimization Ant Colony System information exchange strategies vehicle routing problem with time windows traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

vehicle rerouting in the case of unexpectedly high demand in distribution systems

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2015年 55卷 535-545页

作者： Nikolic, Milos Teodorovic, Dusan Univ Belgrade Fac Traff & Transport Engn Belgrade 11000 Serbia Serbian Acad Arts & Sci Belgrade 11000 Serbia

Many logistics companies use the same vehicle routes every day when distributing goods to the customers. Unexpectedly high demand in some nodes can cause that one or more of the planned vehicle routes are not feasible any more. In such a situation, the new set of vehicle routes should be generated. We propose in this paper the mathematical formulation of this problem. We also propose the Bee Colony Optimization algorithm and principles of lexicographic optimization to solve the problem. When solving the described problem we tried to minimize the negative consequences of the disturbances caused by the increased customer demand. We tested the proposed concept on the Solomon's benchmark example. The obtained results show that Bee Colony Optimization metaheuristic can find high quality solutions in reasonable CPU time. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Disruption management vehicle routing problem with time windows Bee Colony Optimization Lexicographic method

来源：评论

学校读者我要写书评

暂无评论

A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks

引用

FLEXIBLE SERVICES AND MANUFACTURING JOURNAL 2010年第1-2期22卷 83-108页

作者： Kok, A. L. Hans, E. W. Schutten, J. M. J. Zijm, W. H. M. ORTEC Algorithm R&D NL-2800 AL Gouda Netherlands Univ Twente NL-7500 AE Enschede Netherlands

For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport costs. To account for traffic congestion, time-dependent travel times should be considered when constructing vehicle routes. Next, driving hours regulations, which restrict the available driving and working times for truck drivers, must be respected. Since violations are severely fined, also driving hours regulations should be considered when constructing vehicle routes, even more in combination with congestion problems. The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations. The major difficulty of this VRPTW extension is to optimize each vehicle's departure times to minimize the duty time of each driver. Having compact duty times leads to cost savings. However, obtaining compact duty times is much harder when time-dependent travel times and driving hours regulations are considered. We propose a restricted dynamic programming (DP) heuristic for constructing the vehicle routes, and an efficient heuristic for optimizing the vehicle's departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time. Computational experiments demonstrate the trade-off between travel distance minimization and duty time minimization, and illustrate the cost savings of extending the depot opening hours such that traveling before the morning peak and after the evening peak becomes possible.

关键词： Restricted dynamic programming time-dependent travel times Driving hours regulations vehicle routing problem with time windows Duty time minimization

来源：评论

学校读者我要写书评

暂无评论

Co-operation in the Parallel Memetic Algorithm

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2015年第5期43卷 812-839页

作者： Nalepa, Jakub Blocho, Miroslaw Silesian Tech Univ Inst Informat PL-44100 Gliwice Poland ABB ISDC PL-04713 Warsaw Poland

Evolutionary algorithms (EAs) have been attracting research attention for last decades. They were shown to be very efficient in solving various complex optimization problems in most fields of science and engineering. In EAs, the population of solutions evolves in time to explore the search space. Parallel EAs became an important stream of development due to a wide availability of parallel computer architectures. Thus, designing parallel algorithms utilizing hundreds of CPU cores efficiently is critical nowadays. In this paper, we investigate the impact of selecting a co-operation scheme for the parallel memetic algorithm (PMA-VRPTW) to solve the NP-hard vehicle routing problem with time windows. In the island-model PMA-VRPTW, which is a hybrid of a genetic algorithm applied to explore the search space, and some refinement methods to exploit solutions already found, a number of populations are evolved in parallel. Processes then co-operate and exchange solutions according to the co-operation scheme (migration policy, interval, and topology). Extensive experimental study (which comprised more than 1,584,000 CPU hours on an SMP cluster) performed on 1000-customer Gehring and Homberger's (GH) benchmark tests gave a detailed insight into the PMA-VRPTW performance and search capabilities. We report 19 (32 % of all 1000-customer GH tests) new world's best solutions obtained using the best co-operation schemes. Finally, we give clear and consistent guidelines on how to select a proper co-operation scheme in PMA-VRPTW based on the test characteristics.

关键词： Parallel memetic algorithm Island model Co-operation Migration topology vehicle routing problem with time windows

来源：评论

学校读者我要写书评

暂无评论

Modelization of time-Dependent Urban Freight problems by Using a Multiple Number of Distribution Centers

引用

NETWORKS & SPATIAL ECONOMICS 2012年第3期12卷 321-336页

作者： Escuin, David Millan, Carlos Larrode, Emilio Univ Zaragoza Dept Mech Engn Zaragoza Spain Technol Inst Aragon Zaragoza Spain

The aim of the paper is to model urban distribution vehicle routing problems by means of hubs in large cities. The idea behind the urban distribution center (DC) is to provide buffer points where cargo and packages which are to be delivered to shops and businesses can be stored beforehand. At these centers, there will be other kinds of routing problems corresponding to other fairly similar distribution problems. In this paper, a new vehicle routing model (based on the known time-Dependent vehicle routing problem with time windows, TDVRPTW) has been carried out and a change in the traditional approach is proposed, by adopting a system in which some customers are served by urban DCs while remaining customers are served by traditional routes. This study is also motivated by recent developments in real time traffic data acquisition systems, as well as national and international policies aimed at reducing concentrations of greenhouse gases emitted by traditional vans. By using k DCs, the whole problem is now composed of k+1 problems: one special VRPTW for each DC in addition to the main problem, in which some customers and k DC are serviced. The model has been tested by simulating one real case of pharmaceutical distribution within the city of Zaragoza.

关键词： Modelization vehicle routing problem with time windows time-dependent Distribution centers

来源：评论

学校读者我要写书评

暂无评论

A multilevel evaluation method for heuristics with an application to the VRPTW

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2020年第1期27卷 168-196页

作者： Corstjens, J. Depaire, B. Caris, A. Sorensen, K. UHasselt Res Grp Logist B-3590 Diepenbeek Belgium UHasselt Res Grp Business Informat B-3590 Diepenbeek Belgium Univ Antwerp Dept Engn Management Prinsstr B-2000 Antwerp Belgium

The field of combinatorial optimization has inspired the development of a large number of heuristic solution procedures. These methods are commonly assessed using a competitive evaluation methodology that may give an indication of which algorithm has a better performance. A next step in the experimental analysis is to uncover "why" one algorithm performs better. Which elements are responsible for good or bad performance? How does the performance of elements vary across the design space? What is the influence of the specific problem instance that is being solved? We focus on gaining a better understanding of heuristic algorithm performance and demonstrate that the application of a proper statistical methodology can provide researchers insight into how performance is affected by the different algorithm parameters and components. As an example, we apply a multilevel statistical analysis to a large neighborhood search algorithm for the vehicle routing problem with time windows.

关键词： algorithm performance statistical evaluation understanding vehicle routing problem with time windows large neighborhood search metaheuristics

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Spiking Neural P System for Solving vehicle routing problems

引用

ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2020年第4期45卷 2513-2529页

作者： RamachandranPillai, Resmi Arock, Michael Natl Inst Technol Dept Comp Applict Tiruchirappalli Tamil Nadu India

The capabilities of membrane computing frameworks in solving multi-objective constrained optimization problems have invited many researchers to focus their efforts on developing new methods and computational paradigms. Getting motivated from the computational completeness of membrane computing systems (P systems), this paper proposes a new way of solving vehicle routing problems (VRP) using one of the most eminent membrane computing frameworks called spiking neural P systems (SNPS). A new model for SNPS has been recommended both for finding the optimal solutions and for optimizing the parameters that are used in the calculation of minimum feasible insertion cost of the customer insertion phase of VRP without using any heuristic operators. The SNPS suggested here is an adaptive SNPS in which some potentials (ATSNPS) with learning and training facilities are incorporated. Being an NP-hard problem with numerous applications in many areas such as gas distribution management, postal delivery, and truck dispatching, the benefits of this study are far-reaching. Here, a variant of VRP called VRP with time windows (VRPTW) has been used in the proposed system. Since this is the first attempt to find solutions of VRP using ATSNPS, a comparison has been made with the algorithms used over VRPTW. The analysis of results proved that the proposed ATSNPS is substantially superior to the state-of-the-art algorithms in terms of computational time and optimizing the attributes such as the average number of vehicles used and the total distance traveled.

关键词： Spiking neural P system vehicle routing problem with time windows Membrane computing Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

A Fix-and-Optimize Variable Neighborhood Search for the Biomedical Sample Transportation problem

引用

IFAC-PapersOnLine 2018年第11期51卷 992-997页

作者： Toschi, Marta Lanzarone, Ettore Anaya-Arenas, Ana Maria Bélanger, Valérie Nicoletta, Vittorio Ruiz, Angel Milan Italy Department of Logistics and Operations Management HEC Montréal Montréal Canada Montréal Canada Department of Operations and Decision Systems Université Laval Québec Canada Centre interuniversitaire de recherche sur les reseaux d'entreprise la logistique et le transport Montréal and Québec Canada

Biomedical tests play a crucial role in helping physicians to make accurate diagnoses. To perform these tests, thousands of samples are daily transported from several healthcare facilities, where they are collected from patients, to laboratories, where they are analyzed. We consider the challenging Biomedical Sample Transportation problem (BSTP), which is a complex variant of the vehicle routing problem with time windows, where both the number of visits and the opening and closing hours of the collection centers are decision variables, while the objective is to minimize the total duration of routes. We propose a linear programming formulation for the BSTP, and we develop a matheuristics to solve the problem in real-size problem instances, which consists of a decomposition coupled with a Variable Neighborhood Search (VNS) algorithm. The decomposition is based on a spatio-temporal clustering method, which takes into account both the travel times between the centers and their collection periods; then, a Fix-and-Optimize VNS is applied to improve the decomposed solution. The performance of the proposed method is assessed over a large number of realistic instances, which are based on the laboratory network in the Province of Québec, Canada. Results show good quality solutions and the capability of the matheuristics to solve real-size problem instances within an adequate time. © 2018

关键词： problem solving Diagnosis Linear programming Plant shutdowns Travel time vehicle routing Decision variables Healthcare facility Linear programming formulation Spatio temporal clustering Transportation problem Variable neighborhood search vehicle routing problem with time windows vehicle routing problems

来源：评论

学校读者我要写书评

暂无评论

A concept for simulation-based optimization in vehicle routing problems

引用

IFAC-PapersOnLine 2018年第11期51卷 1720-1725页

作者： Mazzuco, D.E. Carreirão Danielli, A.M. Oliveira, D.L. Santos, P.P.P. Pereira, M.M. Coelho, L.C. Frazzon, E.M. Industrial and Systems Engineering Department Federal University of Santa Catarina Campus UFSC FlorianópolisSC Brazil Canada Research Chair in Integrated Logistics Faculty of Administration Sciences Université Laval Québec 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. © 2018

关键词： vehicle routing Contracts Optimization Scheduling Travel time vehicles Complex logistics Distributed production systems Operational performance Simulation Simulation based optimizations vehicle routing problem vehicle routing problem with time windows vehicle routing problems

来源：评论

学校读者我要写书评

暂无评论

An integrated approach to the vehicle routing and container loading problems

引用

OR SPECTRUM 2009年第4期31卷 775-800页

作者： Moura, Ana Oliveira, Jose Fernando Univ Aveiro P-3810193 Aveiro Portugal INESC Coimbra Coimbra Portugal Univ Porto Fac Engn P-4100 Oporto Portugal INESC Porto Oporto Portugal

Real-world distribution problems raise some practical considerations that usually are not considered in a realistic way in more theoretical studies. One of these considerations is related to the vehicle capacity, not only in terms of cubic meters or weight capacity but also in terms of the cargo physical arrangements. In a distribution scene, two combinatorial optimization problems, the vehicle routing problem with time windows and the container loading problem, are inherently related to each other. This work presents a framework to integrate these two problems using two different resolution methods. The first one treats the problem in a sequential approach, while the second uses a hierarchical approach. To test the quality and efficiency of the proposed approaches, some test problems were created based on the well-known Solomon, Bischoff and Ratcliff test problems. The results of the integrated approaches are presented and compared with results of the vehicle routing problem with time windows and the container loading problem applied separately.

关键词： vehicle routing problem with time windows Container loading problem GRASP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：