Search Results - "Cunha, Claudio B."
-
1
Estimating the influence of crowding and travel time variability on accessibility to jobs in a large public transport network using smart card big data
Published in Journal of transport geography (01-05-2020)“…Accessibility metrics are gaining momentum in public transportation planning and policy-making. However, critical user experience issues such as crowding…”
Get full text
Journal Article -
2
A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
Published in European journal of operational research (01-11-2017)“…•We study the uncapacitated single allocation p-hub maximal covering problem.•We propose a tabu search heuristic that improves previous published results.•We…”
Get full text
Journal Article -
3
An exploratory evaluation of urban street networks for last mile distribution
Published in Cities (01-12-2020)“…The increasing congestion of cities together with the unprecedented growth rate of e-commerce has drawn a lot of attention to the challenges of last mile…”
Get full text
Journal Article -
4
A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
Published in European journal of operational research (16-06-2007)“…A heuristic based on genetic algorithms is proposed to the problem of configuring hub-and-spoke networks for trucking companies that operate…”
Get full text
Journal Article -
5
Using GPS data to explore speed patterns and temporal fluctuations in urban logistics: The case of São Paulo, Brazil
Published in Journal of transport geography (01-04-2019)“…Large-scale urban sensing data, such as vehicle global positioning system (GPS) traces, are emerging as an important data source for urban planning. However,…”
Get full text
Journal Article -
6
New simple and efficient heuristics for the uncapacitated single allocation hub location problem
Published in Computers & operations research (01-12-2009)“…Hub-and-spoke networks are widely studied in the area of location theory. They arise in several contexts, including passenger airlines, postal and parcel…”
Get full text
Journal Article -
7
An exact formulation for the multi-period auto-carrier loading and transportation problem in Brazil
Published in Computers & industrial engineering (01-03-2019)“…•We model a variation of the Dynamic Multi-Period Auto-Carrier Transportation Problem.•A mixed-integer programming model to a transportation cost minimization…”
Get full text
Journal Article -
8
A variable neighborhood search algorithm for the bin packing problem with compatible categories
Published in Expert systems with applications (15-06-2019)“…•A new variant of the Bin Packing Problem is introduced.•It is motivated by last mile delivery to tiny stores.•Items to be delivered belong to categories that…”
Get full text
Journal Article -
9
An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo
Published in International transactions in operational research (01-04-2015)“…In this paper, we address the problem of determining the optimal location of ambulance stations, as well as the vehicle allocation and repositioning for the…”
Get full text
Journal Article -
10
Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem
Published in Journal of heuristics (01-12-2005)“…The K-Constraint Multiple Knapsack Problem (K-MKP) is a generalization of the multiple knapsack problem, which is one of the representative combinatorial…”
Get full text
Journal Article -
11
Disaggregated retail forecasting: A gradient boosting approach
Published in Applied soft computing (01-07-2023)“…Demand forecast is a relevant topic for retailers to manage effectively inventories comprising a wide range of Stock Keeping Units (SKUs) at store level. While…”
Get full text
Journal Article -
12
An ALNS metaheuristic for the family multiple traveling salesman problem
Published in Computers & operations research (01-09-2024)“…This paper presents a novel variant of the Family Traveling Salesman Problem (FTSP), a well-known NP-hard problem introduced by Morán-Mirabal et al. (2014). In…”
Get full text
Journal Article -
13
Exploring K-best solutions to enrich network design decision-making
Published in Omega (Oxford) (01-07-2018)“…•We investigate the potential of alternative solutions to facility location.•A method to obtain the K-best solutions is applied to benchmark instances.•We…”
Get full text
Journal Article -
14
An adaptive large neighborhood search metaheuristic for the Generalized Bin Packing problem with incompatible categories
Published in Computers & industrial engineering (01-11-2023)Get full text
Journal Article -
15
A simulation-optimization model for analyzing a demand responsive transit system for last-mile transportation: A case study in São Paulo, Brazil
Published in Case studies on transport policy (01-12-2021)“…•We investigate the potential of a DRT system for last mile feeder transportation.•We present a simulation–optimization vehicle dispatching model.•This case…”
Get full text
Journal Article -
16
Sustainable supply chain design using a multi-objective linear optimization approach for solid bulk products
Published in Cleaner Logistics and Supply Chain (01-12-2024)“…This paper proposes a multi-objective optimization model for designing a sustainable logistics system that determines the ideal logistic flow of an ultrafine…”
Get full text
Journal Article -
17
A multi-stage approach for optimizing the three-echelon joint newspaper distribution network of two major publishers in São Paulo, Brazil
Published in Case studies on transport policy (01-09-2021)“…•A real-world joint newspaper distribution network of two major publishers is optimized.•It is a two- or three-echelon distribution network design problem with…”
Get full text
Journal Article -
18
-
19
-
20
Variable Neighborhood Search for the Bin Packing Problem with Compatible Categories
Published 08-05-2019“…Bin Packing with Conflicts (BPC) are problems in which items with compatibility constraints must be packed in the least number of bins, not exceeding the…”
Get full text
Journal Article