共查询到10条相似文献,搜索用时 78 毫秒
1.
In the open vehicle routing problem (OVRP), the objective is to minimise the number of vehicles and then minimise the total distance (or time) travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced by each vehicle must not exceed vehicle capacity. Additionally, in one variant of the problem, the travel time of each vehicle should not exceed an upper limit. 相似文献
2.
This paper studies an NP-hard multi-period production–distribution problem to minimize the sum of three costs: production setups, inventories and distribution. This problem is solved by a very recent form of metaheuristic called memetic algorithm with population management (MA∣PM). Contrary to classical two-phase methods (production planning, then distribution planning), the algorithm simultaneously tackles production and distribution decisions. Several versions with different population management strategies are evaluated and compared with a two-phase heuristic and a Greedy Randomized Adaptive Search Procedure (GRASP), on 90 randomly generated instances with 20 periods and 50, 100 or 200 customers. The significant savings obtained compared to the two other methods confirm both the interest of integrating production and distribution decisions and of using the MA∣PM template. 相似文献
3.
Simulated annealing metaheuristics for the vehicle routing problem with time windows 总被引:9,自引:0,他引:9
This paper develops simulated annealing metaheuristics for the vehicle routing and scheduling problem with time window constraints.
Two different neighborhood structures, the λ-interchange mechanism of Osman and thek-node interchange process of Christofides and Beasley, are implemented. The enhancement of the annealing process with a short-term
memory function via a tabu list is examined as a basis for improving the metaheuristic approach. Computational results on
test problems from the literature as well as large-scale real-world problem are reported. The metaheuristics achieve solutions
that compare favorably with previously reported results. 相似文献
4.
We present a new branch-and-cut algorithm for the capacitated vehicle routing problem (CVRP). The algorithm uses a variety of cutting planes, including capacity, framed capacity, generalized capacity, strengthened comb, multistar, partial multistar, extended hypotour inequalities, and classical Gomory mixed-integer cuts. For each of these classes of inequalities we describe our separation algorithms in detail. Also we describe the other important ingredients of our branch-and-cut algorithm, such as the branching rules, the node selection strategy, and the cut pool management. Computational results, for a large number of instances, show that the new algorithm is competitive. In particular, we solve three instances (B-n50-k8, B-n66-k9 and B-n78-k10) of Augerat to optimality for the first time. 相似文献
5.
Frédéric Semet 《Annals of Operations Research》1995,61(1):45-65
In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems. 相似文献
6.
A. Divsalar P. Vansteenwegen K. Sörensen D. Cattrysse 《European Journal of Operational Research》2014
In this paper, a memetic algorithm is developed to solve the orienteering problem with hotel selection (OPHS). The algorithm consists of two levels: a genetic component mainly focuses on finding a good sequence of intermediate hotels, whereas six local search moves embedded in a variable neighborhood structure deal with the selection and sequencing of vertices between the hotels. A set of 176 new and larger benchmark instances of OPHS are created based on optimal solutions of regular orienteering problems. Our algorithm is applied on these new instances as well as on 224 benchmark instances from the literature. The results are compared with the known optimal solutions and with the only other existing algorithm for this problem. The results clearly show that our memetic algorithm outperforms the existing algorithm in terms of solution quality and computational time. A sensitivity analysis shows the significant impact of the number of possible sequences of hotels on the difficulty of an OPHS instance. 相似文献
7.
Toshihide Ibaraki Koji Nonobe Mutsunori Yagiura 《Discrete Applied Mathematics》2008,156(11):2050-2069
We propose an iterated local search algorithm for the vehicle routing problem with time window constraints. We treat the time window constraint for each customer as a penalty function, and assume that it is convex and piecewise linear. Given an order of customers each vehicle to visit, dynamic programming (DP) is used to determine the optimal start time to serve the customers so that the total time penalty is minimized. This DP algorithm is then incorporated in the iterated local search algorithm to efficiently evaluate solutions in various neighborhoods. The amortized time complexity of evaluating a solution in the neighborhoods is a logarithmic order of the input size (i.e., the total number of linear pieces that define the penalty functions). Computational comparisons on benchmark instances with up to 1000 customers show that the proposed method is quite effective, especially for large instances. 相似文献
8.
The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem (VRP) to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days for each customer and to solve a VRP for each day. Our method is based on Variable Neighborhood Search (VNS). Computational results are presented, that show that our approach is competitive and even outperforms existing solution procedures proposed in the literature. Also considered is the special case of a single vehicle, i.e. the Periodic Traveling Salesman Problem (PTSP). It is shown that slight changes of the proposed VNS procedure is also competitive for the PTSP. 相似文献
9.
A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm 总被引:2,自引:0,他引:2
Yannis Marinakis Athanasios Migdalas Panos M. Pardalos 《Journal of Global Optimization》2007,38(4):555-580
The Vehicle Routing Problem (VRP) is one of the most well studied problems in operations research, both in real life problems
and for scientific research purposes. During the last 50 years a number of different formulations have been proposed, together
with an even greater number of algorithms for the solution of the problem. In this paper, the VRP is formulated as a problem
of two decision levels. In the first level, the decision maker assigns customers to the vehicles checking the feasibility
of the constructed routes (vehicle capacity constraints) and without taking into account the sequence by which the vehicles
will visit the customers. In the second level, the decision maker finds the optimal routes of these assignments. The decision
maker of the first level, once the cost of each routing has been calculated in the second level, estimates which assignment
is the better one to choose. Based on this formulation, a bilevel genetic algorithm is proposed. In the first level of the proposed algorithm, a genetic algorithm is used for calculating the population of the most promising assignments of
customers to vehicles. In the second level of the proposed algorithm, a Traveling Salesman Problem (TSP) is solved, independently for each member of the population
and for each assignment to vehicles. The algorithm was tested on two sets of benchmark instances and gave very satisfactory
results. In both sets of instances the average quality is less than 1%. More specifically in the set with the 14 classic instances
proposed by Christofides, the quality is 0.479% and in the second set with the 20 large scale vehicle routing problems, the
quality is 0.826%. The algorithm is ranked in the tenth place among the 36 most known and effective algorithms in the literature
for the first set of instances and in the sixth place among the 16 algorithms for the second set of instances. The computational
time of the algorithm is decreased significantly compared to other heuristic and metaheuristic algorithms due to the fact
that the Expanding Neighborhood Search Strategy is used. 相似文献
10.
Guido Perboli Ferdinando Pezzella Roberto Tadei 《Mathematical Methods of Operations Research》2008,68(2):361-382
This paper presents EVE-OPT, a Hybrid Algorithm based on Genetic Algorithms and Taboo Search for solving the Capacitated Vehicle
Routing Problem. Several hybrid algorithms have been proposed in recent years for solving this problem. Despite good results,
they usually make use of highly problem-dependent neighbourhoods and complex genetic operators. This makes their application
to real instances difficult, as a number of additional constraints need to be considered. The algorithm described here hybridizes
two very simple heuristics and introduces a new genetic operator, the Chain Mutation, as well as a new mutation scheme. We
also apply a procedure, the k-chain-moves, able to increase the neighbourhood size, thereby improving the quality of the solution with negligible computational
effort. Despite its simplicity, EVE-OPT is able to achieve the same results as very complex state-of-the art algorithms. 相似文献