• No results found

2-vehicle routing problems

An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window

An Enhanced Ant Colony System for Solving Vehicle Routing Problem with Time Window

... Vehicle Routing Problem [1] is a complex combinatorial, multi constraint problem that holds a central place in logistics, ...NP-Hard problems, it cannot be solved to get optimal solution in ...

5

Computing time dependent travel times in vehicle routing problems

Computing time dependent travel times in vehicle routing problems

... In this section, we discuss the three dierent types of data we need to conduct the experiments. These three data types are similar to the types we discussed in Section 4.1. First, we have the map data for which we use ...

77

Heuristic Algorithm for Min-max Vehicle Routing Problems

Heuristic Algorithm for Min-max Vehicle Routing Problems

... Vehicle Routing Problem is a typical NP problem. Its solution can be divided into three categories: the accurate algorithm, the classic heuristic algorithm and the modern intelligent algorithm. With respect ...

6

Application of Adaptive Large Neighbourhood Search for a Rich and Real World Vehicle Routing Problem

Application of Adaptive Large Neighbourhood Search for a Rich and Real World Vehicle Routing Problem

... This section describes the third solution strategy that we include in this research. In the previous 2 solution strategies, the customer to depot assignment can change in the ALNS procedure. Although we cannot ...

103

Heuristics for New Problems Arising in the Transport of People and Goods

Heuristics for New Problems Arising in the Transport of People and Goods

... ing problems with a mixture of pre–booked customers (known from the start of the plan- ning horizon) and unknown customers (who are only revealed part way through the plan- ning horizon, but should still be served ...

177

A Review Paper on PSO and GA Based Optimization for Vehicle Routing Problem

A Review Paper on PSO and GA Based Optimization for Vehicle Routing Problem

... The Vehicle Routing Problem (VRP) is a complex optimization problem originally proposed by ...of problems dealing with the transportation of goods between one or multiple depots and customers ...

6

A literature review on Vehicle routing problems in a cross docking environment

A literature review on Vehicle routing problems in a cross docking environment

... Vehicle routing problems can be most often modeled with a mathematical formulation and many times as multi-objective optimization models which involves conflicting objectives and algorithms based ...

6

Vehicle routing problems with the use of multi-agent system

Vehicle routing problems with the use of multi-agent system

... Base for other branch of hierarchical algorithms for solving SSSP problem was Highway Hierarchies algo- rithm proposed in [1, 2]. Dijkstras algorithm is used in the preprocessing phase to calculate the ...

9

The vehicle routing problem and its intersection with cross-docking

The vehicle routing problem and its intersection with cross-docking

... x 2 x 2 x 2 x 2) of the variables of ...random problems were generated following normally distributed random variables with the corresponding parameters from Table ...different ...

101

Dispatching Requests for Agent-Based Online Vehicle Routing Problems with Time Windows

Dispatching Requests for Agent-Based Online Vehicle Routing Problems with Time Windows

... online vehicle routing ...the vehicle routes. Each traveler is inserted in the route of the vehicle with the minimum marginal cost (the cost could refer to the incurred detour, for ...

14

A unified tabu search algorithm for vehicle routing problems with soft time windows

A unified tabu search algorithm for vehicle routing problems with soft time windows

... each vehicle route must start and end at the ...the 2-interchange mechanism, but differ in the details of the moves that are ...swap, 2-opt and ‘tails’ ...

11

Three Strategies Tabu Search for Vehicle Routing Problem with Time Windows

Three Strategies Tabu Search for Vehicle Routing Problem with Time Windows

... The vehicle routing problem with time windows (VRPTW) is a crucial issue in transportation and logistics systems [46], ...one vehicle. The routes should satisfy the vehicle capacity and the ...

12

Validation of the loading constraints in vehicle routing problems

Validation of the loading constraints in vehicle routing problems

... retailer 2 does not describe the product types and therefore a contamination matrix cannot be ...retailer 2 dataset does not use compartments to divide their resources, not to mention the flexibility ...

80

The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem

The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem

... locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating ...of vehicle scheduling and it is ...

18

A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW

A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW

... Lin (1965) proposes the λ-optimality mechanism, which is widely applied in routing problems. It re- moves λ edges from one route, and reconnects it in a feasible way. 2-opt and 3-opt are two typical ...

11

FORECASTING THE NUMBER OF DENGUE FEVER CASES IN MALANG REGENCY INDONESIA USING 
FUZZY INFERENCE SYSTEM MODELS

FORECASTING THE NUMBER OF DENGUE FEVER CASES IN MALANG REGENCY INDONESIA USING FUZZY INFERENCE SYSTEM MODELS

... the vehicle routing problem with time windows (VRPTW) in which each customer is associated with a time interval and can only be served within this interval [7], the multi-depot vehicle routing ...

10

A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem

A Novel Constructive Routing Algorithm for Fleet Size and Mix Vehicle Routing Problem

... the routing approach in [1] is denoted as Ochi Minumum Distance Minimum Vertex Algorithm (Ochi MinDis-MinVer Algorithm) and the proposed routing approach is denoted as Karagul Minumum Distance Minimum ...

16

Modeling the Capacitated-Time Windows Vehicle Routing Problem with the Existence of Closed Route

Modeling the Capacitated-Time Windows Vehicle Routing Problem with the Existence of Closed Route

... locating problems are a problem of a distribution system. Problems dealing with the distribution of goods between the warehouse and the customers are referred to as vehicle routing problem ...

5

THE VEHICLE ROUTING PROBLEM WITH LIMITED VEHICLE CAPACITIES

THE VEHICLE ROUTING PROBLEM WITH LIMITED VEHICLE CAPACITIES

... the routing rectilinear distance. We may replace d ij with c ij in Eq. (2) in order to add more routing cost ...one vehicle visits every ...

9

Grammatical evolution hyper heuristic for combinatorial optimization problems

Grammatical evolution hyper heuristic for combinatorial optimization problems

... optimization problems; examination timetabling (Carter [14] and ITC 2007 [15] instances) and the capacitated vehicle routing problem (Christofides [16] and Golden [17] ...

22

Show all 10000 documents...

Related subjects