Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In order to satisfy with the individual and various demand of customer, establish multi-type vehicles vehicle scheduling with picking-delivery model. According to the characteristics of model, hybrid genetic algorithm is used to get the optimization solution. First of all, use natural number coding so as to simplify the problem; use the individual amount control choice strategy so as to guarantee...
This paper proposes a hybrid meta-heuristic, tabu threshold algorithm (TTA), to efficiently and effectively solve vehicle routing problem with time window constraints (VRPTW). TTA integrates tabu search (TS) and threshold accepting (TA). TS is one of the most popular generic heuristics in solving VRPTW in recent years, and TA is a combinatorial optimization meta-heuristic. The first objective is to...
The multidepot vehicle routing problem with interdepot routes (MDVRPI) is an extension to the classical vehicle routing problem (VRP); it is the major research topics in the supply chain management field. It is an extension of the multidepot vehicle routing problem in which vehicles may be replenished at intermediate depots along their route. In this paper, we propose a heuristic combining the adaptative...
This paper presents an arc-guided evolutionary algorithm for solving the vehicle routing problem with time windows, which is a well-known combinatorial optimization problem that addresses the service of a set of customers using a homogeneous fleet of capacitated vehicles within fixed time intervals. The objective is to minimize the fleet size following routes of minimum distance. The proposed method...
This paper describes the split deliveries vehicle routing problem briefly and presents an improved tabu search algorithm. At each iteration, a neighbor solution at each iteration by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility...
The vehicle routing problem with Time windows (VRPTW) issue has attracted significant attention in the operations research community in recent years. The primary objective of VRPTW is defined as the minimization of the number of routes or vehicles. Minimization of the total travel cost is secondary objective. In this paper, VRPTW is examined and a hybrid ant colony system coupled with randomized algorithm...
Based on the principle of kernel route, a tabu search algorithm is designed for large-scale integrated vehicle routing problem (LSIVRP) with constraints of capacity and delivery distance. The algorithm has two phases: initial optimization and post-optimization. In initial optimization, the kernel routes in route library are updated constantly to form the framework of optimal routes. In the first phase...
The vehicle routing problem with simultaneous pickup and delivery is the problem of optimally integrating goods distribution and waste collection. We analyze the vehicle routing problem in which, a single depot can offer service to many customers that may both receive and send good by multiple vehicles, customers strictly require that their delivery and pickup is to be served in a single visit by...
A hybrid tabu search algorithm, which generates initial solution by genetic algorithm, is proposed here to solve the vehicle routing problems with time windows (VRPTW). Experimental result shows that this algorithm is better than the other known algorithms.
This paper describes a new design of Tabu search (ts) algorithm for solving the vehicle routing problem with time windows (VRPTW). Since VRPTW is a well known NP-hard problem, heuristic algorithms such as Tabu search are always used to get a good approach. The former published designs of TS usually focus on the neighbor structure, the relaxation to the objective function or the multi-period algorithms...
In this article we study the capacitated location routing problem (CLRP) which is defined as a combination of two problems: the facility location problem (FLP) and the vehicle routing problem (VRP). The CLRP is not just a purely academic construct; it has many applications in the practice. We propose a hybrid approach based on a tabu search algorithm combined with an improved ant colony system to...
In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures which can solve complex problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS), a vehicle routing problem (VRP) is examined and a hybrid ant colony system coupled with a stochastic local...
An algorithm for a new vehicle dispatch model with time window rearrangement is proposed. The customer calls company and asks for service and time window in which service begin, and the company arrange the appropriate position for each customer without violating time window constraint. If the need of customer can not be satisfied, another time window is assigned to the customer. Firstly, the initial...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.