Ghiani Gianpaolo

Gianpaolo Ghiani

Information about the author Gianpaolo Ghiani will soon be added to the site.
Found 36 papers in total
Approximation neighborhood evaluation for the design of the logistics support of complex engineering systems
Approximation neighborhood evaluation for the design of the logistics support of complex engineering systems
2017
This paper deals with the problem of designing the logistics support of complex...
Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
2017
In this paper, we deal with single machine scheduling problems subject to time...
The time-dependent quickest path problem: Properties and bounds
The time-dependent quickest path problem: Properties and bounds
2015
The fast computation of point‐to‐point quickest paths on very large...
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem
2012
Advances in information technology and telecommunications, together with...
Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem
2010
In the Job Sequencing and Tool Switching Problem, a number of part types, each...
Shift scheduling problem in same-day courier industry
Shift scheduling problem in same-day courier industry
2010
This paper deals with the problem of minimizing the staffing cost of a same-day...
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
2010
The aim of this paper is to introduce a new ant colony optimization procedure for the...
Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design
2007
The single loop material flow system design is a combinatorial optimization problem,...
New policies for the dynamic traveling salesman problem
New policies for the dynamic traveling salesman problem
2007
The dynamic traveling salesman problem is a variant of the classical traveling...
A combined procedure for discrete simulation–optimization problems based on the simulated annealing framework
A combined procedure for discrete simulation–optimization problems based on the simulated annealing framework
2007
This paper addresses the problem of optimizing a function over a finite or countable...
Integrated shipment dispatching and packing problems: a case study
Integrated shipment dispatching and packing problems: a case study
2007
In this paper we examine a consolidation and dispatching problem motivated by a...
The black and white traveling salesman problem
The black and white traveling salesman problem
2006
The black and white traveling salesman problem (BWTSP) is defined on a graph G whose...
Integrated shipment dispatching and packing problems: a case study
Integrated shipment dispatching and packing problems: a case study
2007
In this paper we examine a consolidation and dispatching problem motivated by a...
A constructive heuristic for the Undirected Rural Postman Problem
A constructive heuristic for the Undirected Rural Postman Problem
2006
This paper describes a constructive heuristic for the well-known Undirected Rural...
Waste collection in Southern Italy: solution of a real-life arc routing problem
Waste collection in Southern Italy: solution of a real-life arc routing problem
2005
We conducted a study on solid waste collection for the Health Department of the...
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
2004
In the Dial-a-Ride problem (DARP) users specify transportation requests between...
Fix and relax heuristic for a stochastic lot-sizing problem
Fix and relax heuristic for a stochastic lot-sizing problem
2006
This paper addresses a particular stochastic lot-sizing and scheduling problem. The...
Parallel tabu search for a pickup and delivery problem under track contention
Parallel tabu search for a pickup and delivery problem under track contention
2003
This article introduces the Pickup and Delivery Problem under Track Contention, a...
Scenario-based planning for lot-sizing and scheduling with uncertain processing times
Scenario-based planning for lot-sizing and scheduling with uncertain processing times
2006
This paper addresses the identical parallel machine lot-sizing and scheduling problem...
Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
2004
In the Dial-a-Ride problem (DARP) users specify transportation requests between...
Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem
Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem
2005
In this article the probabilistic pickup and delivery travelling salesman problem is...
An algorithm for the hierarchical Chinese postman problem
An algorithm for the hierarchical Chinese postman problem
2000
The Hierarchical Chinese Postman Problem (HCPP) is a variant of the classical Chinese...
Solving the hierarchical Chinese postman problem as a rural postman problem
Solving the hierarchical Chinese postman problem as a rural postman problem
2004
In the undirected hierarchical Chinese postman problem (HCPP), the edges of a graph...
A heuristic for the periodic rural postman problem
A heuristic for the periodic rural postman problem
2005
The periodic rural postman problem (PRPP) is variant of the classicial rural postman...
Papers per page: