Mixture experiments usually involve various constraints on the proportions of the ingredients of the mixture under study. In this paper, inspired by the fact that the available stock of certain ingredients is often limited, we focus on a new type of constraint, which we refer to as an ingredient...

Stated choice experiments are conducted to identify the attributes that drive people's preferences when choosing between competing options of products or services. They are widely used in transportation in order to support the decision making of companies and governmental authorities. A large...

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...

Many real-world large datasets correspond to bipartite graph data settings; think for example of users rating movies or people visiting locations. Although some work exists over such bigraphs, no general network-oriented methodology has been proposed yet to perform node classification. In this...

In this paper, a metaheuristic approach is presented to solve the Clustered Vehicle Routing Problem (CluVRP). The CluVRP, in which customers are grouped into predefi?ned clusters, can be seen as a generalisation of the classical Capacitated Vehicle Routing Problem (CVRP). When serving all these...

Het doel van deze studie is om inzicht te verkrijgen in de ontwikkelingen in de binnenvaarttanksector. In een onderzoek naar drogeladingvloot (van Hassel, 2013), werd er vastgesteld dat er sprake is van een zeer grote capaciteitsopbouw van laadvermogen. Deze opbouw vond vooral plaats in het...

The basic deterministic stationary inventory problem, in which backorders are allowed, is analyzed. Instead of considering the backorder cost to be a cost per unit and per time, we also suppose the presence of a fixed backorder cost per unit. The latter generates a supplementary dependence of...

In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by solving restricted mixed integer programs...

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...

We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees. The objective is the minimization of edge costs but could also...