A constant fixed cost of establishing a facility is introduced within the framework of minisum facility location in the continuous space. The solution metho...

In this exploratory study, a segmentation analysis of a shopping mall’s customers is conducted according to the activities they performed during their visit,...

A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in the continuous space. An efficient algorithm for determin...

A critical aspect of operating an airline is to continuously maintain adequate staffing levels of qualified crewmembers. The airline must be able to plan sev...

The integrated aircraft routing and crew scheduling problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each fl...

Column generation is often used to solve problems involving set partitioning constraints, such as vehicle routing and crew scheduling problems. When these co...

This paper examines the convergence properties of two well-known heuristics: variable neighborhood search (VNS) and random multistart local search (MLS). Bot...

When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...

The berth allocation problem is to allocate space along the quayside to incoming ship at a container terminal in order to minimize some objective function....

The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of the...

In order to achieve a successful implementation of electronic commerce (EC), it is necessary to "re-engineer" the logistics activities of the enterprise. Thi...

Ce document présente une revue de littérature sur la logistique inverse. Dans la littérature, plusieurs termes sont utilisés comme des synonymes, par exemple...

We propose a numerical approach to compute stationary Markov perfect Nash equilibrium advertising strategies of Lanchester model. The algorithm can be implem...

A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...

This paper deals with the issue of shelf-space allocation and advertising decisions in marketing channels. We consider a network composed of a unique retaile...

In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...

This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...

We define two classes of lower bounds using either one or two simplices for the minimization of a concave function over a polytope. For each of them, a pro...