Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...

We present a dual algorithm to minimize a separable convex function under ratio constraints between variables. This minimization problem occurs when the dep...

This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...

In this paper we analyze the problem of finding the trading area for a facility on a linear market. Given the objective of maximizing profit, we first build...

This paper examines a class of asymmetrical multi-depot vehicle routing problems and location-routing problems, under capacity or maximum cost restrictions. ...

In this paper, an extension of the classical scheduling problem is considered. It is assumed that tasks are processed on parallel processors, available at d...

Recently we have witnessed the development of a fast growing body of research focused on vehicle routing and scheduling problem structures with time window c...

Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in ...

This paper considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling sale...

Hydraulic turbine runners are used in electricity generation. These consist of a cylinder around which are welded, at regular spacings, a number of blades w...

In this paper the authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how...

Post box collection constitutes a complex and costly operation in most postal services. The authors recently undertook a study aimed at improving this opera...

This article examines a constrained shortest path problem which occurs in the design by column generation of vehicle routes constructed to satisfy a set of t...

This paper describes a vehicle flow model for a two-echelon location-routing problem involving deliveries from primary to secondary facilities and from secon...

The aim of this paper is to develop an exact algorithm for the asymmetrical distance constrained vehicle routing problem. The problem is solved by means of ...

The single-vehicle dial-a-ride problem with time window constraints for both pick-up and delivery locations, and precedence and capacity constraints, is solv...

This paper describes an exact algorithm for a general class of asymmetrical vehicle routing problems. Vehicle routes start and end at a central depot. Visi...

Let n facilities be located on a bounded linear market and assume that demand for a homogenous commodity is uniformly distributed along that market. Initial...

This paper presents an exact algorithm for a generalized version of the Travelling Salesman Problem which consists of finding the shortest Hamiltonian cirnui...

This paper describes an exact algorithm for the asymmetrical multiple travelling salesman problem. The problem is solved by branch and bound and a flow circ...