Gonzalo Romero | University of Toronto (original) (raw)
Related Authors
Western Norwegian Research Institute (Vestlandsforsking)
Uploads
Papers by Gonzalo Romero
International Transactions in Operational Research, 2013
Ship routing problems are a particular kind of routing problems, where the vehicles to be routed ... more Ship routing problems are a particular kind of routing problems, where the vehicles to be routed are vessels or ships, usually in maritime environments. In contrast to land routing, ship routing has unique features, including overnight trips, disjoint time windows, not necessarily pre-specified routes, and a great uncertainty derived from weather conditions. In this work we present a special ship routing problem, which incorporates many features present in general ship routing settings. We discuss aspects related with data gathering and updating, which are particularly difficult in the context of ship routing. Additionally, we present a GRASP algorithm to solve this problem. We apply our solution approach to a salmon feed supplier based in southern Chile, and present computational results on real data.
Operations Research Letters, 2014
ABSTRACT We study a continuous knapsack problem with separable convex utilities. We show that the... more ABSTRACT We study a continuous knapsack problem with separable convex utilities. We show that the problem is NP-hard, and provide two simple algorithms that have worst-case performance guarantees. We consider as an application a novel subsidy allocation problem in the presence of market competition, subject to a budget constraint and upper bounds on the amount allocated to each firm, where the objective is to minimize the market price of a good.
International Transactions in Operational Research, 2013
Ship routing problems are a particular kind of routing problems, where the vehicles to be routed ... more Ship routing problems are a particular kind of routing problems, where the vehicles to be routed are vessels or ships, usually in maritime environments. In contrast to land routing, ship routing has unique features, including overnight trips, disjoint time windows, not necessarily pre-specified routes, and a great uncertainty derived from weather conditions. In this work we present a special ship routing problem, which incorporates many features present in general ship routing settings. We discuss aspects related with data gathering and updating, which are particularly difficult in the context of ship routing. Additionally, we present a GRASP algorithm to solve this problem. We apply our solution approach to a salmon feed supplier based in southern Chile, and present computational results on real data.
Operations Research Letters, 2014
ABSTRACT We study a continuous knapsack problem with separable convex utilities. We show that the... more ABSTRACT We study a continuous knapsack problem with separable convex utilities. We show that the problem is NP-hard, and provide two simple algorithms that have worst-case performance guarantees. We consider as an application a novel subsidy allocation problem in the presence of market competition, subject to a budget constraint and upper bounds on the amount allocated to each firm, where the objective is to minimize the market price of a good.