An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints
YA Koskosidis, WB Powell… - Transportation …, 1992 - pubsonline.informs.org
The Vehicle Routing and Scheduling Problem with Time Window constraints is formulated
as a mixed integer program, and optimization-based heuristics which extend the cluster-first, …
as a mixed integer program, and optimization-based heuristics which extend the cluster-first, …
Clustering algorithms for consolidation of customer orders into vehicle shipments
YA Koskosidis, WB Powell - Transportation Research Part B …, 1992 - Elsevier
… KOSKOSIDIS The efficient consolidat … We refer the interested reader to Koskosidis (1988)
for further details. … The detailed computational results can be found in Koskosidis (1988). Table …
for further details. … The detailed computational results can be found in Koskosidis (1988). Table …
A scenario-based aproach to active asset allocation
YA Koskosidis, AM Duarte - Journal of Portfolio Management, 1997 - search.proquest.com
Efficient frontier-based optimization is driven heavily by the historical and the expected
returns of the assets involved. A study presents an asset allocation framework that uses …
returns of the assets involved. A study presents an asset allocation framework that uses …
A game theoretic/network equilibrium solution approach for the railroad freight car management problem
EA Adamidou, AL Kornhauser, YA Koskosidis - … Research Part B …, 1993 - Elsevier
The paper presents the development and solution procedures of a mathematical model of
the management of a fleet of cars shared by autonomous profit maximizing managers faced …
the management of a fleet of cars shared by autonomous profit maximizing managers faced …
Application of Optimization Based Models on Vehicle Routing
YA Koskosidis, WB Powell - Journal of Business Logistics, 1990 - search.proquest.com
… Koskosidis is assistant professor of civil engineering and an associate with the Institute for
Transportation Systems of the City University of New York. He specializes in transportation …
Transportation Systems of the City University of New York. He specializes in transportation …
Princeton_ TIGRESS 2.0: High refinement consistency and net gains through support vector machines and molecular dynamics in double‐blind predictions during the …
…, AJ Koskosidis, YA Guzman… - Proteins: Structure …, 2017 - Wiley Online Library
Protein structure refinement is the challenging problem of operating on any protein structure
prediction to improve its accuracy with respect to the native structure in a blind fashion. …
prediction to improve its accuracy with respect to the native structure in a blind fashion. …
The split delivery vehicle scheduling problem with time windows and grid network distances
PW Frizzell, JW Giffin - Computers & Operations Research, 1995 - Elsevier
We consider an extension of the Split Delivery Vehicle Routing Problem, whereby customers
may have a time window for their delivery. A construction heuristic is developed which uses …
may have a time window for their delivery. A construction heuristic is developed which uses …
[BOOK][B] Optimization based models and algorithms for routing and scheduling with time window constraints
IA Koskosidis - 1988 - search.proquest.com
In this dissertation we deal with the development of models and algorithms for the Vehicle
Routing Problem with Time Window Constraints based on a new class of algorithms, named …
Routing Problem with Time Window Constraints based on a new class of algorithms, named …
A column generation approach to capacitated p-median problems
LAN Lorena, ELF Senne - Computers & Operations Research, 2004 - Elsevier
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities,
considering distances and capacities for the service to be given by each median. In this …
considering distances and capacities for the service to be given by each median. In this …
A genetic algorithm approach for location-inventory-routing problem with perishable products
In this paper, we address a location-inventory-routing model for perishable products. The
model determines the number and location of required warehouses, the inventory level at each …
model determines the number and location of required warehouses, the inventory level at each …