The Vehicle Routing Problem with Backhauls (VRPB) is an extension of the VRP that deals with two types of customers: the consumers (linehaul) that request goods from the depot and the suppliers (backhaul) that send goods to the depot. In this paper, we propose a simple yet effective iterated...

The accessibility arc upgrading problem (AAUP) is a network upgrading problem that arises in real-life decision processes such as rural network planning. In this paper, we propose a linear integer programming formulation and two solution approaches for this problem. The first approach is based...

In industrial experimentation, there is growing interest in studies that span more than one processing step. Convenience often dictates restrictions in randomization in passing from one processing step to another. When the study encompasses three processing steps, this leads to split-split-plot...

Conjoint choice experiments elicit individuals' preferences for the attributes of a good by asking respondents to indicate repeatedly their most preferred alternative in a number of choice sets. However, conjoint choice experiments can be used to obtain more information than that revealed by the...

For the algorithmic construction of optimal experimental designs, it is important to be able to evaluate small modifications of given designs in terms of the optimality criteria at a low computational cost. This can be achieved by using powerful update formulas for the optimality criteria during...

The semi-Bayesian approach for constructing efficient stated choice designs requires the evaluation of the design selection criterion value over numerous draws taken from the prior parameter distribution assumed when generating the design. The semi-Bayesian D-criterion value of a design is then...