Lawrence Snyder

ORCID: 0000-0002-2227-7030
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Parallel Computing and Optimization Techniques
  • Interconnection Networks and Systems
  • Supply Chain and Inventory Management
  • Distributed and Parallel Computing Systems
  • Embedded Systems Design Techniques
  • Supply Chain Resilience and Risk Management
  • Sustainable Supply Chain Management
  • Facility Location and Emergency Management
  • Vehicle Routing Optimization Methods
  • Algorithms and Data Compression
  • Advanced Data Storage Technologies
  • Smart Grid Energy Management
  • Optimization and Search Problems
  • Cellular Automata and Applications
  • Transportation and Mobility Innovations
  • Distributed systems and fault tolerance
  • VLSI and FPGA Design Techniques
  • Digital Image Processing Techniques
  • Forecasting Techniques and Applications
  • Low-power high-performance VLSI design
  • Electric Vehicles and Infrastructure
  • Quality and Supply Management
  • Cloud Computing and Resource Management
  • Logic, programming, and type systems
  • Artificial Intelligence in Games

Lehigh University
2014-2024

University of Washington
2001-2015

Seattle University
1988-2014

Nova Southeastern University
2013

Utrecht University
1994

Ithaka Harbors
1994

Cornell University
1994

Purdue University West Lafayette
1981-1984

Yale University
1975-1982

University of Warwick
1981

Classical facility location models like the P-median problem (PMP) and uncapacitated fixed-charge (UFLP) implicitly assume that, once constructed, facilities chosen will always operate as planned. In reality, however, “fail” from time to due poor weather, labor actions, changes of ownership, or other factors. Such failures may lead excessive transportation costs customers must be served much farther than their regularly assigned facilities. this paper, we present for choosing locations...

10.1287/trsc.1040.0107 article EN Transportation Science 2005-08-01

We present an end-to-end framework for solving the Vehicle Routing Problem (VRP) using reinforcement learning. In this approach, we train a single model that finds near-optimal solutions problem instances sampled from given distribution, only by observing reward signals and following feasibility rules. Our represents parameterized stochastic policy, applying policy gradient algorithm to optimize its parameters, trained produces solution as sequence of consecutive actions in real time,...

10.48550/arxiv.1802.04240 preprint EN other-oa arXiv (Cornell University) 2018-01-01

10.1016/j.trb.2011.05.022 article EN Transportation Research Part B Methodological 2011-06-19

Problem definition: The beer game is widely used in supply chain management classes to demonstrate the bullwhip effect and importance of coordination. a decentralized, multiagent, cooperative problem that can be modeled as serial network which agents choose order quantities while cooperatively attempting minimize network’s total cost, although each agent only observes local information. Academic/practical relevance: Under some conditions, base-stock replenishment policy optimal. However,...

10.1287/msom.2020.0939 article EN Manufacturing & Service Operations Management 2021-02-23

10.1016/j.ejor.2004.09.057 article EN European Journal of Operational Research 2005-05-18

10.1016/j.ejor.2005.03.076 article EN European Journal of Operational Research 2006-04-19

The two most widely considered measures for optimization under uncertainty are minimizing expected cost and worst-case or regret. In this paper, we present a novel robustness measure that combines the objectives by while bounding relative regret in each scenario. particular, models seek minimum-expected-cost solution is p-robust; i.e., whose no more than 100p% We p-robust based on classical facility location problems. solve both problems using variable splitting, with Lagrangian subproblem...

10.1080/07408170500469113 article EN IIE Transactions 2006-09-07

article Free AccessA Linear Time Algorithm for Deciding Subject Security Authors: R. J. Lipton Department of Computer Science, Yale University, 10 Hillhouse Avenue, New Haven, CT CTView Profile , L. Snyder Authors Info & Claims Journal the ACMVolume 24Issue 3July 1977 pp 455–464https://doi.org/10.1145/322017.322025Published:01 July 1977Publication History 131citation1,015DownloadsMetricsTotal Citations131Total Downloads1,015Last 12 Months63Last 6 weeks7 Get Citation AlertsNew Alert...

10.1145/322017.322025 article EN Journal of the ACM 1977-07-01

This paper proposes a Real-Time Pricing (RTP)-based power scheduling scheme as demand response for residential usage. In this scheme, the Energy Management Controller (EMC) in each home and service provider form Stackelberg game, which EMC who schedules appliances' operation plays follower level sets real-time prices according to current usage profile leader game. The sequential equilibrium is obtained through information exchange between them. Simulation results indicate that our can not...

10.1109/icassp.2011.5947718 article EN 2011-05-01

We study an integrated supply chain design problem that determines the locations of retailers and assignments customers to minimize expected costs location, transportation, inventory. The system is subject random disruptions may occur at either supplier or retailers. Analytical numerical studies reveal effects these on retailer customer allocations. In addition, we demonstrate numerically cost savings from considering phase (rather than tactical operational phase) are usually significant.

10.1287/trsc.1100.0320 article EN Transportation Science 2010-03-19

10.1016/0743-7315(87)90018-9 article EN Journal of Parallel and Distributed Computing 1987-10-01

We consider mechanisms to optimize electricity consumption both within a home and across multiple homes in neighborhood. The are assumed use energy management controllers (EMCs) control the operation of some their appliances. EMCs, which feature emerging SmartGrid, prices user preferences power usage home. first present simple optimization model for determining timing appliance take advantage lower rates during off-peak periods. then demonstrate, using simulation, that resulting solution may...

10.1109/smartgrid.2010.5622084 article EN 2010-10-01

The newsvendor problem is one of the most basic and widely applied inventory models. If probability distribution demand known, can be solved analytically. However, approximating not easy prone to error; therefore, resulting solution may optimal. To address this issue, we propose an algorithm based on deep learning that optimizes order quantities for all products features data. Our integrates forecasting inventory-optimization steps, rather than solving them separately, as typically done,...

10.1080/24725854.2019.1632502 article EN IISE Transactions 2019-06-20

The Folklore is replete with stories of "secure" protection systems being compromised in a matter hours. This quite astounding since one not likely to claim that system secure without some sort proof support the claim. In practice, provided and reason for this clear: although primitives are apparently simple, they may potentially interact extremely complex ways. Vague informal arguments, therefore, often overlook subtleties an adversary can exploit. Precision merely desirable systems, it mandatory.

10.1109/sfcs.1976.1 article EN 1976-10-01
Coming Soon ...