No abstract

The rise of research into shared mobility systems reflects emerging challenges, such as rising traffic congestion, rising oil prices and rising environmental concern. The operations research community has turned towards more sharable and sustainable systems of transportation. Shared mobility systems can be collapsed into two main streams: those where people share rides and those where parcel transportation and people transportation are combined. This survey sets out to review recent research in this area, including different optimization approaches, and to provide guidelines and promising directions for future research. It makes a distinction between prearranged and real-time problem settings and their methods of solution, and also gives an overview of real-case applications relevant to the research area.

Faced with the challenges associated with sustainably feeding the world's growing population, the food industry is increasingly relying on operations research (OR) techniques to achieve economic, environmental and social sustainability. It is therefore important to understand the context-specific model-oriented applications of OR techniques in the sustainable food supply chain (SFSC) domain. While existing food supply chain reviews provide an excellent basis for this process, the explicit consideration of sustainability from a model-oriented perspective along with a structured outline of relevant SFSC research techniques are missing in extant literature. We attempt to fill this gap by reviewing 83 related scientific journal publications that utilise mathematical modelling techniques to address issues in SFSC. To this end, we first identify the salient dimensions that include economic, environmental and social issues in SFSC. We then review the models and methods that use these dimensions to solve issues that arise in SFSC. We identify some of the main challenges in analytical modelling of SFSC as well as future research directions.

No abstract

No abstract

No abstract

This paper addresses a new transportation problem called lane reservation problem in time constrained transportation. It originates from large sportive events in a city or region where the travel time between sportive villages and stadium should fall in a strict time window. To guarantee the timely transportation in an already traffic saturated city, the problem consists in temporarily creating special lanes on roads in the transportation network. The objective is to minimize the total weighted cost of reserved lanes so as to minimize the traffic impact to the normal traffic situation. In this paper, this problem is formulated as an integer linear programming model. An efficient heuristic is presented to obtain near optimal solutions due to the complexity of the problem. Numerical results show that the average gap between solutions obtained by the proposed heuristic and that by a software package (Lingo 8.0) is less than 1.59% for small size instances, while the average computational time with the heuristic is less than one second. As a case study, the proposed heuristic is applied to the transportation planning in Guangzhou Asian Games.

No abstract