Companies frequently offer wholesale prices for their products that decrease with the number of purchased items. However, single buyers may not be willing or able to purchase large quantities of a single item. Nevertheless, consumers can form groups to purchase at wholesale prices, obtaining...

In the m-Capacitated Peripatetic Salesman Problem (m-CPSP) the aim is to determine m Hamiltonian cycles of minimal total cost on a graph, such that all the edges are traversed less than the value of their capacity. This article introduces three formulations for the m-CPSP. Two branch-and-cut...

In this paper, we address a bi-objective vehicle routing problem in which the total length of routes is minimized as well as the balance of routes, i.e. the difference between the maximal route length and the minimal route length. We propose a meta-heuristic method based on an evolutionary...

This chapter introduces the book of homonymous title. It motivaites the development of the book and present the different visions of city/urban logistics. Moreover, all chapters are introduced and commented.