Journal: Annals of Operations Research

Found 3339 papers in total
Heuristic reliability optimization by tabu search
1996,
A new heuristic algorithm, based on the tabu search methodology, is proposed for...
Focused simulated annealing search: An application to job shop scheduling
1996,
This paper presents a simulated annealing search procedure developed to solve job shop...
A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem
1996,
In this paper, the authors study the application of a meta-heuristic to a two-machine...
A comparison of local search methods for flow shop scheduling
1996,
Local search techniques are widely used to obtain approximate solutions to a variety...
Activity graphs: A language for flexible consultation systems
1996,
An intelligent decision system (IDS) uses artificial intelligence principles to...
An exact algorithm for the capacitated shortest spanning arborescence
1995,
The authors are given a complete and loop-free digraph G=(V,a), where V={1,...,n} is...
Using artificial neural networks to solve the orienteering problem
1995,
In the orienteering problem, the authors are given a transportation network in which a...
A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations
1995,
The authors consider the basic Vehicle Routing Problem (VRP) in which a fleet of M...
A two-phase algorithm for the partial accessibility constrained vehicle routing problem
1995,
In the partial accessibility constrained vehicle routing problem, a route can be...
Routing models and solution procedures for regional Less-Than-Truckload operations
1995,
Less-Than-Truckload (LTL) carriers are required on a daily basis to solve Intra-Group...
A new branching strategy for time constrained routing problems with application to backhauling
1995,
In this paper, the authors explore a new branching strategy for branch-and-bound...
Dynamic vehicle routing: Status and prospects
1995,
Although most real-world vehicle routing problems are dynamic, the traditional...
A computer assistant for vehicle dispatching with learning capabilites
1995,
In this paper, the authors describe an expert consulting system for a dispatcher...
A heuristic method for dispatching repair men
1995,
A company has to provide a service to its customers. A service consists of a visit to...
Routing problems: A bibliography
1995,
The bibliography contains 500 references on four classical routing problems: the...
On properties of geometric random problems in the plane
1995,
This paper presents results dealing with properties of well-known geometric random...
Dynamic traffic assignment: Considerations on some deterministic modelling approaches
1995,
Research on how to model the dynamic behaviour of traffic flows efficiently and the...
A continuous day-to-day traffic assignment model and the existence of a continuous dynamic user equilibrium
1995,
Suppose that a road network model is given, together with some given demand for travel...
System optimal and user equilibrium time-dependent traffic assignment in congested networks
1995,
This paper formulates two dynamic network traffic assignment models in which O-D...
A note on the minimum instantaneous cost path of the dynamic traffic assignment problem
1995,
The paper considers an example to show that the minimum instantaneous cost path...
Censored regression analysis of multiclass passenger demand data subject to joint capacity constraints
1995,
In most passenger transportation systems, demand for seats is not recorded after all...
Locating flow-intercepting facilities: New approaches and results
1995,
The problem of locating flow-intercepting facilities on a network with probabilistic...
The planning of headways in urban public transit
1995,
A basic issue in the planning of urban public transport is the determination of...
Determination of the number and locations of time points in transit schedule design-Case of a single run
1995,
An analytical model for the determination of the number and locations of time points...
Papers per page: