We consider a selective vehicle routing problem, in which customers belonging to di?fferent partners in a logistic coalition are served in a single logistic operation with multiple vehicles. Each partner determines a cost of non-delivery (CND) for each of its customers, and a central algorithm...

Distribution companies that serve a very large number of customers, courier companies for example, often partition the geographical region served by a depot into zones. Each zone is assigned to a single vehicle and each vehicle serves a single zone. An alternative approach is to partition the...

In this paper, a variable neighborhood search (VNS) algorithm is developed and analyzed that can generate fifth species counterpoint fragments. The existing species counterpoint rules are quantified and form the basis of the objective function used by the algorithm. The VNS developed in this...

Recently, a trend towards horizontal collaboration in the supply chain has been gaining ground. Collaborative supply chains promise to improve sustainability and reduce transportation costs at the same time. This paper examines the possibility of collaboration and its implementation through a...

Horizontal collaboration among shippers is gaining traction as a way to increase logistic efficiency. The total distribution cost of a logistic coalition is generally between 9% and 30% lower than the sum of costs of each partner distributing separately. However, the coalition gain is highly...

By bundling orders of different partners within the time windows suggested to their 3PLs, a large reduction in cost can be achieved. However, these benefits can be further enlarged by loosening the time window constraints. Using the real costs structure of delivering an order too early or too...

Purpose: When collaborating, partners inevitably suffer changes in the way of working, costs or service aspects. However, some changes are easier to implement than others, and can be (easily) compensated by the positive effects of collaboration. This paper aims to give an overview of the...

Using a structured design methodology, we develop an eXcient iterated local search metaheuristic for the water distribution network design optimisation problem. The algorithm outperforms existing algorithms in the literature while being considerably less complex. Our approach is — contrary to...

We focus on the D-optimal design of screening experiments involving main-effects regression models, especially with large numbers of factors and observations. We propose a new selection strategy for the coordinate-exchange algorithm based on an orthogonality measure of the design. Computational...

This paper surveys the literature on the optimisation of water distribution network design. The water distribution network design (WDND) optimisation problem entails nding the type and diameter of each pipe in the network so that the total cost of the network is minimised without violating any...