Vigo Daniele

Daniele Vigo

Information about the author Daniele Vigo will soon be added to the site.
Found 30 papers in total
Territory-Based Vehicle Routing in the Presence of Time-Window Constraints
Territory-Based Vehicle Routing in the Presence of Time-Window Constraints
2015
Territory‐based routing approaches (TBRAs) are commonly used to achieve high...
A problem-adjusted genetic algorithm for flexibility design
A problem-adjusted genetic algorithm for flexibility design
2013
Many present markets for goods and services have highly volatile demand due to short...
Location routing for small package shippers with subcontracting options
Location routing for small package shippers with subcontracting options
2012
We present a location routing model that considers the requirements of...
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping
2013
In this paper, we investigate a routing problem arising in the last‐mile...
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
2012
This paper studies the Traveling Salesman Problem with Pickups, Deliveries, and...
A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem
A Genetic/Tabu Thresholding Hybrid Algorithm for the Process Allocation Problem
1997
In this paper we describe an hybrid heuristic approach, which combines Genetic...
The Two‐Echelon Capacitated Vehicle Routing Problem: Models and Math‐Based Heuristics
The Two‐Echelon Capacitated Vehicle Routing Problem: Models and Math‐Based Heuristics
2011
Multiechelon distribution systems are quite common in supply‐chain and...
Exact algorithms for routing problems under vehicle capacity constraints
Exact algorithms for routing problems under vehicle capacity constraints
2010
The solution of a vehicle routing problem calls for the determination of a set of...
Lower bounds and heuristics for the Windy Rural Postman Problem
Lower bounds and heuristics for the Windy Rural Postman Problem
2007
In this paper we present several heuristic algorithms and a cutting-plane algorithm...
The granular tabu search and its application to the vehicle-routing problem
The granular tabu search and its application to the vehicle-routing problem
2003
We describe a new variant, called granular tabu search, of the well-known tabu-search...
An exact approach to the Strip-Packing problem
An exact approach to the Strip-Packing problem
2003
We consider the problem of orthogonally packing a given set of rectangular items into...
TSpack: A unified tabu search code for multi-dimensional bin packing problems
TSpack: A unified tabu search code for multi-dimensional bin packing problems
2004
We present a computer code that implements a general Tabu Search technique for the...
Models and bounds for two-dimensional level packing problems
Models and bounds for two-dimensional level packing problems
2004
We consider two-dimensional bin packing and strip packing problems where the items...
Heuristic algorithms for the three-dimensional bin packing problem
Heuristic algorithms for the three-dimensional bin packing problem
2002
The Three-dimensional Bin Packing Problem (3BP) consists of allocating, without...
A tabu search algorithm for the open shop problem
A tabu search algorithm for the open shop problem
1997
In this paper we consider the minimum makespan Open Shop problem without preemption....
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
1997
In this paper, we present a branch-and-cut algorithm for the exact solution of an...
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems
1999
Two-dimensional bin packing problems consist of allocating, without overlapping, a...
The three-dimensional bin packing problem
The three-dimensional bin packing problem
2000
The problem addressed in this paper is that of orthogonally packing a given set of...
Exact and heuristic algorithms for data sets reconstruction
Exact and heuristic algorithms for data sets reconstruction
2000
Given a data set defined by n samples, the Data set Reconstruction Problem (DRP)...
A genetic tabu thresholding hybrid algorithm for the process allocation problem
A genetic tabu thresholding hybrid algorithm for the process allocation problem
1997
In this paper we describe a hybrid heuristic approach, which combines Genetic...
Heuristics for the traveling salesman problem with pickup and delivery
Heuristics for the traveling salesman problem with pickup and delivery
1999
We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD), an...
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
1999
We consider an extension of the capacitated Vehicle Routing Problem (VRP), known as...
Approximation algorithms for the oriented two-dimensional bin packing problem
Approximation algorithms for the oriented two-dimensional bin packing problem
1999
Given a set of rectangular items which may not be rotated and an unlimited number of...
Modeling and solving the crew rostering problem
Modeling and solving the crew rostering problem
1998
The Crew Rostering Problem (CRP) aims at determining an optimal sequencing of a given...
Papers per page: