IBM ILOG Dispatcher User's Manual > Index

Index

arc 1, 2

distances between nodes

arc cost 1, 2

array of neighborhoods

bays

best accept search 1, 2

breaks

building routes

capacitated arc routing problem

capacity 1, 2

coherence of submodels

compatibility constraints

modeling vehicle break

on capacity

on cumul variable bounds

on late deliveries

on number of vehicles

on vehicle

setting up visit disjunctions

time

visit disjunction

cost 1, 2

arc

calculating routing plan

calculating vehicle

computing on arcs

early and late

fixed

from total length of route

minimizing 1, 2, 3

turn penalty

vehicle fixed 1, 2

visit penalty 1, 2

current partial route

customer location

alternative

definition

time constraints on

decision variable 1, 2

declaring

length

time

weight

decomposition

problem 1, 2, 3

delay variable

delivery and pickup visits

delta

solution

depot

assigning trucks to multiple

definition

multiple

depot docking bays

designing Dispatcher models

destructor

dimension 1, 2

associating constrained variable with

disjunctions

dispatching technicians 1, 2

distance 1, 2

Euclidean 1, 2

enumeration heuristic

environment

Euclidean distance 1, 2

exchange neighborhood

extrinsic dimension

first accept search 1, 2, 3

first solution

generating 1, 2

first solution framework

first solution heuristics

vehicle 1, 2

geographical decomposition

GLS

granularity

graph functionality

greedy search

grid pattern distance

guided local search 1, 2

guided local search (gls)

construction

savings 1, 2

sweep

IlcGoal 1, 2

IloAny type definition

IloBool type definition

IloConcatenate

IloCouple

ILOCPGOALWRAPPER 1, 2

IloCross 1, 2

IloCsvReader

IloDecouple

IloDichotomize

IloDimension

IloDimension1 1, 2, 3

IloDimension2 1, 2

IloDiscreteResource

IloDispatcher 1, 2, 3, 4

getCostVar

getIndex 1, 2

IloDispatcher::RouteIterator

operator*

operator++

IloDispatcherGenerate

IloDispatcherGLS

IloDispatcherGraph 1, 2

IloDispatcherTabuSearch 1, 2

IloDistance

IloEarlinessFunction

IloEnv 1, 2, 3

IloEuclidean

IloExchange 1, 2

IloFPRelocate

ILOG Scheduler

IloGenerateRoute

IloGoal

IloImprove 1, 2

IloInfinity

IloInsertionGenerate 1, 2, 3

IloInsertVisit

IloInstantiateVehicleBreaks

IloInt type definition

IloLimitSearch

IloMakePerformed 1, 2

IloMakePerformedPair

IloMakeUnperformed 1, 2

IloManhattan

IloModel 1, 2, 3, 4

IloNearestAdditionGenerate 1, 2

IloNearestDepotGenerate 1, 2

IloNHood

IloNHoodArray

IloNode 1, 2

IloNum type definition

IloNumToNumSegmentFunction

IloOrderedVisitPair

IloOrOpt 1, 2, 3

IloRelocate 1, 2

IloRestoreSolution 1, 2

IloRoutingSolution 1, 2, 3, 4

getNext

getPrev

isPerformed

IloRoutingSolution::RouteIterator

operator*

operator++

IloSavingsGenerate 1, 2, 3

IloSetTimesForward

IloSimpleVisitToNumFunction

IloSingleMove 1, 2, 3, 4, 5

IloSolution

end

IloSolver 1, 2

IloStoreBestSolution

IloSwapPerform 1, 2

IloSweepGenerate 1, 2

IloTardinessFunction

IloTwoOpt 1, 2, 3

IloVehicle

getCapacity

getCostVar 1, 2

getFirstVisit 1, 2, 3

getLastVisit 1, 2, 3

getSpeed 1, 2

setCapacity

setCost

IloVisit 1, 2, 3, 4

getCumul 1, 2

getCumulVar 1, 2, 3, 4

getDelayVar

getNextVar 1, 2

getPrevVar 1, 2

getTransitVar

getTravelVar

getVehicleVar 1, 2, 3

getWaitVar

performed

IloVisitArray

IloVisitToNumFunction

IloVisitVehicleCompat

improvement loop 1, 2

improving

solution 1, 2

iterative solution process 1, 2, 3

iterative solving

mixed

iterator

lateness

limited

capacity

linking library to application

local minimum

escaping

local search 1, 2

loop

improvement 1, 2

Manhattan distance

metaheuristic 1, 2

minimize

cost

distance

minimizing number of vehicles

minimizing the number of vehicles

mixed iterative solving

model 1, 2, 3

modeling hints 1, 2

move operators

Multiple Depot Pickup and Delivery Problem

Multiple Depot Vehicle Routing Problem (MDVRP)

improving the solution 1, 2

multiple tours heuristic

multiple tours per vehicle

nearest addition heuristic

nearest-to-depot heuristic

neighborhood

2-opt

cross

exchange

inter-route 1, 2

intra-route 1, 2

swap

neighborhoods 1, 2

next-variable

node

arc

definition

specifying coordinates

move

associating with visit

visit

personal computer (pc)

linking Solver library on

Pickup and Delivery Problem (PDP)

pickup and delivery visits

problem decomposition 1, 2, 3

problem size

quantities

relocate neighborhood

remove visit 1, 2

route

calculating total cost

cost variable

routing problem

multiple depots

routing solution 1, 2

savings heuristic 1, 2

best accept 1, 2

first accept 1, 2

greedy

guided local

guided tabu

tabu

search method

guided local search (gls)

local 1, 2

shortest path 1, 2, 3

solution

improving 1, 2

improving with degrading moves

iterative 1, 2, 3

restore

routing 1, 2

solution delta

speed

vehicle

submodel

TSP

swap array

synchronization 1, 2, 3, 4, 5, 6, 7

technicians

dispatching 1, 2, 3

temporal decomposition 1, 2

time

time constraints

time window 1, 2, 3

disjoint

implementing constraint on

tour

turn

linking Solver library on

unperformed visits 1, 2

variable

constrained

cost

cumulative

decision 1, 2

delay 1, 2

prev-

transit

travel

vehicle

wait

vehicle

and capacity constraints

calculating total cost

implementing breaks on

implementing deadlines on

limit on number available

multiple tours

setting capacity

start-visit

vehicle break 1, 2

changing value of wait and cumul variables

definition

duration 1, 2

implementing

interrupting customer visit

position

start time 1, 2

vehicle breaks

vehicle capacity

vehicle fixed cost 1, 2

Vehicle Routing Problem (VRP) 1, 2

vehicle speed

vehicles

minimizing number of 1, 2

visit

add

associating penalty cost

creating disjunctions

interrupting with vehicle break

unperformed 1, 2, 3

visit disjunction constraint

visit disjunctions

visit pairs

visit penalty cost 1, 2

visit swap array

weight

writing a first solution heuristic