Table of Contents Table of Contents
Previous Page  305 / 561 Next Page
Information
Show Menu
Previous Page 305 / 561 Next Page
Page Background

INFORMS Nashville – 2016

305

3 - Freight Demand Management And It’s Role In Sustainable

Supply Chains

Johanna Amaya, Rensselaer Polytechnic Institute, Troy, NY,

12180, United States,

amayaj@iastate.edu

Johanna Amaya, Iowa State University, Ames, IA, 50011,

United States,

amayaj@iastate.edu

A wide range of potential actions could enhance the sustainability of urban

freight activity ranging from supply to demand sides. By far, the least frequently

used group is freight demand management (FDM). Managing the demand could

play a key role in increasing the sustainability of urban freight activity as this

group seeks to alter the demand for freight to mitigate the negative impacts

produced. Instead of focusing on the carriers, these initiatives focus on changing

the behavior of the receivers of the supplies, which are the ones that generate the

demand. Their potential and current implementation is discussed as a tool to

foster sustainable supply chains.

4 - Analysis Of Non-cooperative Joint Emissions Targeting Decisions

In A Leader-follower Channel

Dincer Konur, Missouri University of Science and Technology,

konurd@mst.edu

In this study, we analyze joint emission targeting along a leader-follower channel.

In particular, a non-cooperative game theory model is constructed to determine

the agents’ decisions on joining their emissions targets. Joint emission targeting

might decrease individual as well as channel costs while ensuring that total

emissions do no exceed cumulative emission target. We characterize the

equilibrium solution of this game. Furthermore, how costs and emissions change

with joint targeting is analyzed. In addition, we investigate the role of the leader

on channel emissions and costs. It is discussed that changing the leader might

decrease not only costs but also emissions.

TC10

103C-MCC

Optimizing Distributed Energy Generation I

Sponsored: Energy, Natural Res & the Environment, Energy II Other

Sponsored Session

Chair: Alexandra M Newman, Colorado School of Mines, Golden, CO,

newman@mines.edu

1 - Optimizing The Design Of A Hybrid, Distributed Energy

Generation System With Alternate, Renewable Technologies

Gavin Goodall, Colorado School of Mines, Golden, CO,

ggoodall@mymail.mines.edu

We formulate a mixed integer linear program to select renewable technologies

such as photovoltaic panels, hydrogen fuel cells and plasma converters, and

conventional technologies such as diesel generators and lithium-ion batteries, to

minimize system costs subject to operational, load, and spinning reserve

constraints. We use statistical models to generate realizations of load and solar

irradiance. Solutions from our optimization model prescribe both a procurement

and an hourly dispatch strategy for these realizations.

2 - Geothermic Fuel Cell System Modeling And Optimization

Gladys Anyenya, Colorado School of Mines, Golden, CO,

ganyenya@mymail.mines.edu

This study presents a techno-economic nonlinear optimization model to

determine the optimal design and dispatch of a Geothermic Fuel Cell (GFC)

system. GFCs present an ambitious new approach to cost-effective,

environmentally responsible oil-shale processing. Heat produced from solid-oxide

fuel cells (SOFCs) during electricity generation is used to directly retort oil shale

into liquid oil and natural gas. The electricity produced by the SOFCs during the

oil-liberation process can be used to drive other balance-of-plant equipment, or

be placed back onto the grid. The model solves for the optimal GFC operating

conditions that meet the system electricity and heating demands at the lowest

cost.

3 - Optimization Of Energy Efficient Operation Of HVAC System As

Demand Response With Distributed Energy Resources

Young M Lee, IBM Research Center, 1101 Kitchanwan Road,

P.O. Box 218, Yorktown Heights, NY, 10598, United States,

ymlee@us.ibm.com

, Raya Horesh, Leo Liberti

A model predictive control (MPC) framework that optimally determines control

profiles of the HVAC system as demand response in presence of on-site distributed

energy resources such as energy storage system and energy generation system is

described. The approach computes optimal set point profile of HVAC system that

minimizes the total energy costs and GHG emission, considering demand response

signal, on-site energy storage system, and on-site energy generation system while

satisfying thermal comfort (e.g., zone temperature) within physical limitations of

HVAC equipment, energy storage system and energy generation system.

4 - An Optimization Model For Leftover Biomass Feedstock

N. Muhammad Aslaam Mohamed Abdul Ghani, Graduate Student,

North Dakota State University, 1320 Albrecht Blvd, Quentin

Burdick Building, Fargo, ND, 58108, United States,

nmuhammadaslaam.moha@ndsu.edu,

Chrysafis Vogiatzis,

Joseph Szmerekovsky

We address the issue of leftover biomass feedstock by designing a biomass supply

chain for biofuel and biopower production. A mixed integer linear program

(MILP) is proposed to minimize total societal costs in the supply chain and is then

used to analyze the impact of government incentives for producing biofuel and

biopower. Potential farms for incentivizing will be identified using the proposed

model, which can be useful tool for decision and policy makers.

TC11

104A-MCC

Paths, Cycles, and Transversals

Sponsored: Optimization, Network Optimization

Sponsored Session

Chair: Balabhaskar Balasundaram, Oklahoma State University,

322 Engineering North, Stillwater, OK, 74078, United States,

baski@okstate.edu

1 - Algorithms For Cycles In Graphs

James B Orlin, Massachusetts Institute of Technology,

jorlin@mit.edu

We present: an O(nm) algorithm for finding the least cost cycle in a graph, an

O(nm log n) randomized algorithm for finding the shortest negative cost cycle in

a graph, and a proof that finding the 2nd shortest s-t path is “harder” than finding

the least cost cycle.

2 - New Facets For The Clique Transversal Polytope

Timothy Becker, Rice University,

tjbecker04@gmail.com

The Clique Transversal Problem is the problem of finding a minimum set of nodes

that covers every maximal clique in a given graph. We define three new classes of

facets for the Clique Transversal Polytope. These are extensions of the classes of

facets with coefficients in {0,1,2} for the set covering polytope. One class contains

an odd hole with distinct cliques on each edge of the hole. The second similar

class contains a clique with distinct cliques on |K| edges, where |K| is the number

of nodes in the given clique. The last class contains a clique with distinct cliques

on every edge of the initial clique.

3 - Elementary Shortest Path Problem On Networks Containing

Negative Cycles

Baski Balasundaram, Oklahoma State University, Stillwater, OK,

United States,

baski@okstate.edu,

Devaraja Radha Krishnan

In this talk, we consider the elementary shortest path problem (to find a shortest

path from a specified origin to destination) in a directed network that contains

negative cycles. This problem is known to be NP-hard unlike its classical

counterpart on networks without negative cost directed cycles. We propose a

delayed constraint generation framework to solve this problem using a branch-

and-cut algorithm. Two variants are proposed and compared against solving direct

formulations of this problem. Results and insights from our computational study

will be reported.

4 - Speed Optimization Over A Path In Quadratic Time

Xiaochen Zhang, University of Minnesota,

zhan4487@umn.edu

,

Qie He, Kameng Nip

The speed optimization problem over a path aims to determine speed over each

arc of the given path to minimize the total cost, while respecting speed limits over

arcs and time-window constraints of the nodes. The cost over each arc is a strictly

differentiable convex function of the speed over the arc. This problem is

motivated by the goal of improving fuel efficiency in maritime transportation. It

can be formulated as a min-convex-cost flow problem. We propose an iterative

algorithm running in time quadratic in the number of nodes over the path. This is

joint work with Qie He and Kameng Nip.

TC11