Raymond R. Hill

Learn More
In the vehicle routing problem (VRP) a fleet of vehicles with limited capacity is utilised to supply the demand of a set of customers located around a unique depot while minimising the total travelled distance. All customer demands are supplied and customers are visited by exactly one vehicle. In the split delivery vehicle routing problem (SDVRP), customers(More)
In the 1990s, Agent-Based Modeling (ABM) began gaining popularity and represents a departure from the more classical simulation approaches. This departure, its recent development and its increasing application by non-traditional simulation disciplines indicates the need to continuously assess the current state of ABM and identify opportunities for(More)
To date, most search theory study has focused either on analytical models of specific situations requiring rigid assumptions, or, as in the case of search and rescue, operational experiments aimed at obtaining detection probabilities for a variety of scenarios. Analytical search theory results provide bounds on empirical results. This research introduces an(More)
To date, most search theory study has focused either on analytical models of specific situations requiring rigid assumptions, or, as in the case of search and rescue, operational experiments aimed at obtaining detection probabilities for a variety of scenarios. Analytical search theory results provide bounds on empirical results. This research introduces an(More)
In order to assay the extent of ongoing synaptic remodelling in adult mouse neuromuscular junctions, dynamic structural changes of identified neuromuscular junctions were monitored in vivo over periods up to three months. Nerve terminal outgrowths as small as 1 micron were detectable with a new fluorescent tetanus toxin C-fragment stain combined with(More)
We briefly describe genetic algorithms (GAs) and focus attention on initial population generation methods for twodimensional knapsack problems. Based on work describing the probability a random solution vector is feasible for 0-1 knapsack problems, we propose a simple heuristic for randomly generating good initial populations for genetic algorithm(More)