Emanuele Tresoldi

University of Milan | UNIMI · Department of Computer Science

A number of decision support tools facilitating the use of Electric Vehicles (EVs) have been recently developed. Due to the EVs’ limited autonomy, routing and path planning are the main challenges treated in such tools. Specifically, determining at which Charging Stations (CSs) to stop, and how much the EV should charge at them is complex. This com...

A number of decision support tools facilitating the use of Electric Vehicles (EVs) have been recently developed. Due to the EVs’ limited autonomy, routing and path planning are the main challenges treated in such tools. Specifically, determining at which Charging Stations (CSs) to stop, and how much the EV should charge at them is complex. This com...

In this paper we present a new arc-based mathematical formulation and a heuristic algorithm for the capacitated scheduling problem with conflict jobs. The effectiveness of our approaches is demonstrated through extensive computational experiments. The results demonstrate that our formulation outperforms existing models proposed in the literature.

We consider a scheduling problem where a set of n jobs has to be processed in a non-preemptive way on a set of m identical parallel machines. Each job j is associated with a positive integer processing time pj. The problem is also characterized by a conflict graph where adjacent nodes in the graph represent conflicting jobs that cannot be processed...

In this paper we present a new arc-based mathematical formulation and a heuristic algorithm for the capacitated scheduling problem with conflict jobs. The effectiveness of our approaches is demonstrated through extensive computational experiments. The results demonstrate that our formulation outperforms existing models proposed in the literature.

We consider a scheduling problem where a set of n jobs has to be processed in a non-preemptive way on a set of m identical parallel machines. Each job j is associated with a positive integer processing time p j. A conflict graph is also part of the problem description. Each node in the graph represents a job. Adjacent nodes in the graph represent c...

We address the design of the lines of a Walking Bus service according to a new paradigm, where children are picked up at home. The scarcity of accompanying persons together with the limit on the length of the deviations from the shortest itinerary of each child make the problem different from the traditional school bus and walking bus design. We pr...

Local public transport companies, especially in large cities, are facing every day the problem of managing delays and small disruptions. Disruption management is a well-established practice in airlines and railways. However, in local public transport the approaches to these problems have followed a different path, mainly focusing on holding and sho...

In this paper we propose a practical optimization approach based on the rolling-horizon paradigm to address general single-product periodic-review inventory control problems. Our framework supports many constraints and requirements that are found in real inventory problems and does not rely on any assumption on the statistical distribution of rando...

We study the problem of designing walking school bus lines (Pedibus) limiting the deviation with respect to the shortest path for each child, with the objective of minimizing the number of accompanying persons and the perceived risk of the selected trajectories. The problem is formulated using a path model and a column generation approach is propos...

In this paper, we propose a decision support tool to assist a local public transportation company in tackling service delays and small disruptions. We discuss different ways to assess and improve the regularity of the service, and we propose a simulation based optimization system that can be effectively used in a real-time environment taking into a...

In this article, we consider a variation of the vehicle routing problem arising in the optimization of waste management systems. Constraints imposing adequate level of service to the citizens and even workload among the drivers make the problem challenging and ask for the design of specialized algorithmic approaches. We propose an exact optimizatio...

Coupling the European Electricity Markets is the only way to optimally allocate the cross-border transmission capacity. Computationally, it is impossible to solve the exact mathematical model describing altogether the Italian Uniform Purchase Price and the Central Western and Northern Europe block offers. Thus, the approach developed in this work c...

In this paper we present a general framework for tackling combined location and routing problems (LRPs), involving both costs and profits at the same time. Our framework is based on an extended model and a unified branch-and-cut-and-price method, using dynamic programming pricing routines, strengthening cuts, primal heuristics, stabilization and ad...

This paper describes the algorithms used in a plan- ning and scheduling software tool developed for the European Space Agency in the framework of the Mars Express mission. The planning and scheduling algorithm computes a feasible schedule for the transmission of telecommands (TCs) from the ground seg- ment to the space segment, complying with a num...

We present a model for the optimization of logistics operations in emergency health care systems; in particular, we study the problem of efficient distribution of vaccines or drugs through the simultaneous and coordinated use of distribution centers and vehicles. We devise an exact algorithm based on column generation with three different types of...

The problem of computing a schedule of maximum robustness for the Mars Express mission is formulated and solved via linear programming (LP). We also provide a characterization of ??easy?? and ??difficult?? instances such that the former ones can be solved to optimality directly, without having recourse to any optimization algorithm. In both cases,...

In this work we present an exact optimization algorithm for a profitable vehicle routing problem arising in the con-text of planetary explorations, where sites of potential in-terest need to be visited for collecting data. The problem requires to place bases on the planet surface, and organize missions, assigning routes to a set of agents, coping w...