Brainstorming-Based Ant Colony Optimization for Vehicle Routing With Soft Time Windows
نویسندگان
چکیده
منابع مشابه
A goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملA Hybrid Ant Colony System for Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem occurring in many logistics systems. The objective of VRPTW is to serve a set of customers within their predefined time windows at minimum cost. Ant Colony System algorithm (ACS) that is capable of searching multiple search areas simultaneously in the solution space is good in diversification. On the other hand, Simul...
متن کاملAnt Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time Windows relates to frequently occuring real world problems in logistics. Much work has been done on solving static routing problems but solving the dynamic variants has not been given an equal amount of attention, while these are even more relevant to most companies in logistics and transportation. In this work an Ant Colony Optimization algorithm for solvi...
متن کاملA Hybrid Ant Colony System for Vehicle Routing Problem with Time Windows
Vehicle Routing Problem with Time Windows (VRPTW) is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. Different analytic and heuristic approaches have been tried to solve such problems. The proposed hybrid algorithm uses ant colony system as well as random se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2894681